Abstract
We seek families of subsets of an n-set of given size that contain the fewest k-chains. We prove a “supersaturation-type” extension of both Sperner’s Theorem (1928) and its generalization by Erd˝os (1945). Erd˝os showed that a largest k-chain free family in the Boolean lattice is formed by taking all subsets
... read more