Dilworth 1950: minimum number of chains covering poset = max antichain size. Dual to Mirsky's theorem. Foundational for order-theoretic combinatorics; König's theorem in bipartite graphs as special case.
Dilworth 1950: minimum number of chains covering poset = max antichain size. Dual to Mirsky's theorem. Foundational for order-theoretic combinatorics; König's theorem in bipartite graphs as special case.