Page "Dilworth's theorem" Paragraph 11

Like a number of other results in combinatorics, Dilworth's theorem is equivalent to König's theorem on bipartite graph matching and several other related theorems including Hall's Marriage theorem.