Sperner's theorem
In an n-element set, any family of subsets in which no member contains another has size at most the central binomial coefficient, \(\binom{n}{\lfloor n/2\rfloor}\). Equality is attained by all subsets of size \(\lfloor n/2\rfloor\) or \(\lceil n/2\rceil\).