Sperner's theorem
= Sperner's theorem
{c}
{wiki}
= Sperner theorem
{c}
{synonym}
Every antichain in $\mathcal P([n])$ has at most $\binom n{\lfloor n/2\rfloor}$ members. Equality is attained only by a full middle level, with either middle level possible when $n$ is odd.