Sperner / LYM inequality

Layer 0 — Mathematicsin the combinatorics subtree

Sperner 1928: the largest antichain in the Boolean lattice 2^[n] has size C(n, ⌊n/2⌋) (the middle layer). LYM (Lubell-Yamamoto-Meshalkin) refines this: for any antichain 𝒜, Σ_{A∈𝒜} 1/C(n, |A|) ≤ 1. Foundation of the extremal set-theory…

Related concepts

Explore Sperner / LYM inequality on the interactive knowledge graph →