Dilworth's theorem/Definition: Difference between revisions
Jump to navigation
Jump to search
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.) |
imported>Chris Day No edit summary |
||
| Line 1: | Line 1: | ||
<noinclude>{{subpages}}</noinclude> | |||
In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set. | In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set. | ||
Latest revision as of 17:33, 2 February 2009
This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.
Dilworth's theorem [r]: In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set.