Shattering-extremal set systems from Sperner families
Combinatorics
2017-10-10 v1
Abstract
We say that a set system shatters a given set if . The Sauer-Shelah lemma states that in general, a set system shatters at least sets. Here we concentrate on the case of equality. A set system is called \emph{shattering-extremal} if it shatters exactly sets. A conjecture of R\'onyai and the second author and of Litman and Moran states that if a family is shattering-extremal then one can add a set to it and the resulting family is still shattering-extremal. Here we prove this conjecture for a class of set systems defined from Sperner families.
Keywords
Cite
@article{arxiv.1710.03165,
title = {Shattering-extremal set systems from Sperner families},
author = {Christopher Kusch and Tamás Mészáros},
journal= {arXiv preprint arXiv:1710.03165},
year = {2017}
}
Comments
15 pages