English

Shattering-extremal set systems from Sperner families

Combinatorics 2017-10-10 v1

Abstract

We say that a set system F2[n]\mathcal{F}\subseteq 2^{[n]} shatters a given set S[n]S\subseteq [n] if 2S={F  S: F  F}2^S= \{F~\cap~S:~F~\in~\mathcal{F}\}. The Sauer-Shelah lemma states that in general, a set system F\mathcal{F} shatters at least F|\mathcal{F}| sets. Here we concentrate on the case of equality. A set system is called \emph{shattering-extremal} if it shatters exactly F|\mathcal{F}| 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

R2 v1 2026-06-22T22:07:45.562Z