Dilworth's theorem

In any finite poset P, the minimum number of chains needed to partition P equals the maximum size of an antichain (the width w(P)). LP-duality between chain-cover and antichain-selection. Non-trivial infinite generalisations exist…