Tags: #theorem

Statement

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

The max size of an antichain is equal to the minimum number of chains needed to cover all elements of $P$.

Dual to Mirsky's theorem

Proof

$(\le )$ Any antichain can have at most one element per chain.