 Erdős theorem on k-Sperner families

Among $k$-Sperner subfamilies of $\mathcal{P}([n])$, the maximum cardinality is the sum of the $k$ largest binomial coefficients $\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. The union of the corresponding levels attains the bound. For the upper bound, the Lubell mass is at most $k$, and assigning its available mass to the levels with largest binomial coefficients maximizes cardinality.