Sperner 1928 (Math. Z. 27:544) — the maximum antichain size of the Boolean lattice 2^[n] (power set of {1,...,n} ordered by inclusion) is C(n, ⌊n/2⌋), the binomial coefficient at the middle level. The antichain attaining the bound is…
Sperner 1928 (Math. Z. 27:544) — the maximum antichain size of the Boolean lattice 2^[n] (power set of {1,...,n} ordered by inclusion) is C(n, ⌊n/2⌋), the binomial coefficient at the middle level. The antichain attaining the bound is…