Dilworth's theorem/Definition
Jump to navigation
Jump to search

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.