Dilworth's theorem/Definition
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.
In an ordered set the maximal size of an antichain is equal to the minimal number of chains which together cover the set.