Dilworth's theorem


Dilworth's theorem

[′dil‚wərths ‚thir·əm] (mathematics) The theorem that, in a finite partially ordered set, the maximum cardinality of an antichain is equal to the minimum number of disjoint chains into which the partially ordered set can be partitioned.