Tags: #theorem

Statement

Let $P$ be a finite partially ordered set (poset).

The maximum size of a chain is the minimum number of antichains that covers $P$.

Dual to Dilworth's theorem

Proof