The k-element subsets of an n-element set form a Sperner family, the size of which is maximized when k = n/2 (or the nearest integer to it).
The Lubell-Yamamoto-Meshalkin inequality provides another bound on the size of a Sperner family, and can be used to prove Sperner's theorem.