Metraipolis › archive › dc_4f7ca8feeb71
Dilworth's theorem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Dilworth%27s_theorem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:45:58.610Z
- SHA-256 of the archived text
137632d6a6b431ada6f9ed456164937b1b86b5d1fd2a2e224ce4a85de25e2dcf- Stable URL of this page
https://metraipolis.com/documento/dc_4f7ca8feeb71
How to cite
Dilworth's theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Dilworth%27s_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4f7ca8feeb71 (Metraipolis archive dc_4f7ca8feeb71, sha256 137632d6a6b431ada6f9ed456164937b1b86b5d1fd2a2e224ce4a85de25e2dcf)
BibTeX
@misc{dc4f7ca8feeb71,
title = {Dilworth's theorem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Dilworth%27s_theorem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4f7ca8feeb71; sha256 137632d6a6b431ada6f9ed456164937b1b86b5d1fd2a2e224ce4a85de25e2dcf},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Dilworth%27s_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem states that, in any finite partially ordered set, the maximum size of an antichain of incomparable elements equals the minimum number of chains needed to cover all elements. This number is called the width of the partial order. The theorem is named for the mathematician Robert P. Dilworth, who published it in 1950. A version of the theorem for infinite partially ordered sets states that, when there exists a decomposition into finitely many chains, or when there exists a finite upper bound on the size of an antichain, the sizes of the largest antichain and of the smallest chain decomposition are again equal. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»). Fonte: Wikipedia in inglese, voce «Dilworth's theorem» — https://en.wikipedia.org/wiki/Dilworth%27s_theorem Wikidata Q1134776 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1134776 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Dilworth%27s_theorem?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1305701504, consultata il 2026-10-07T22:20:08.556Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d83fc3fc3c6b2dea674c4e64bb769966770aa45249ddfe5727cd5f820c5cf57f