Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite partially ordered sets
|
| gptkbp:field |
gptkb:order_theory
combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Dilworth's theorem
|
| gptkbp:namedAfter |
gptkb:Robert_P._Dilworth
|
| gptkbp:publicationYear |
1950
|
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:König's_theorem
gptkb:Mirsky's_theorem antichain chain poset |
| gptkbp:sentence |
In any finite partially ordered set, the size of the largest antichain equals the minimum number of chains needed to cover the set.
|
| gptkbp:statedIn |
1940s
|
| gptkbp:bfsParent |
gptkb:Erdős–Dushnik–Miller_theorem
|
| gptkbp:bfsLayer |
5
|