Dilworth's theorem/Definition

From Citizendium
< Dilworth's theorem
Revision as of 13:11, 30 November 2008 by imported>Richard Pinch (In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set.