Mirsky: height(2^[n]) = n+1 exact

Layer 0 — Mathematicsin the order-theory subtree

Mirsky 1971 dual of Dilworth — the maximum chain length in 2^[n] is n+1, achieved by the full flag of successive single-element extensions ∅ ⊂ {1} ⊂ {1,2} ⊂ ... ⊂ {1,...,n}. Mirsky's theorem more generally says the minimum number of…

Related concepts

Explore Mirsky: height(2^[n]) = n+1 exact on the interactive knowledge graph →