Sperner property (source code)

= Sperner property
{c}

A finite <ranked partially ordered set> has the <Sperner property> if its largest <antichain> has the same size as its largest rank level. Each level is already an <antichain>, so the property says that mixing different ranks cannot produce a larger one.

The <Boolean lattice> of all subsets of an $n$-element <set>, ordered by inclusion and ranked by subset size, has this property by <Sperner's theorem>. Its largest <antichain> has size $\binom n{\lfloor n/2\rfloor}$. For $n=3$, the three singletons form a largest <antichain>. General ranked orders need not have the property, making it a substantive extremal condition.