Construct · 1 fields · 1 citations

Dilworth's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorics

the result that in any finite partially ordered set the largest antichain has the same size as the fewest chains needed to cover the set.

In combinatorics, Dilworth's theorem refers to the result that in any finite partially ordered set the largest antichain has the same size as the fewest chains needed to cover the set. This meaning comes from Dilworth (1950) in The Annals of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Dilworth's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

cover2 fields · 4 citationsjingle · one word, two constructs size1 fields · 1 citationsanchor · a standalone construct

References

Dilworth, R. P. (1950). A Decomposition Theorem for Partially Ordered Sets. The Annals of Mathematics, 51(1), 161. https://doi.org/10.2307/1969503

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct