Dilworth theorem
E1463329
UNEXPLORED
Dilworth's theorem is a fundamental result in order theory that relates the size of the largest antichain in a finite partially ordered set to the minimum number of chains needed to cover the set.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Dilworth theorem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21046823 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dilworth theorem Context triple: [Sperner family, relatedConcept, Dilworth theorem]
-
A.
Erdős–Gallai theorem
The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
-
B.
Gallai theorem
Gallai's theorem is a fundamental result in graph theory and Ramsey theory that characterizes the structure of colorings of complete graphs by guaranteeing large monochromatic or well-organized subgraphs.
-
C.
Ore's theorem
Ore's theorem is a fundamental result in graph theory that gives a degree-based criterion guaranteeing a simple graph contains a Hamiltonian cycle.
-
D.
Menger theorem in graph theory
Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
-
E.
Erdős–Rado theorem
The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dilworth theorem Target entity description: Dilworth's theorem is a fundamental result in order theory that relates the size of the largest antichain in a finite partially ordered set to the minimum number of chains needed to cover the set.
-
A.
Erdős–Gallai theorem
The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
-
B.
Gallai theorem
Gallai's theorem is a fundamental result in graph theory and Ramsey theory that characterizes the structure of colorings of complete graphs by guaranteeing large monochromatic or well-organized subgraphs.
-
C.
Ore's theorem
Ore's theorem is a fundamental result in graph theory that gives a degree-based criterion guaranteeing a simple graph contains a Hamiltonian cycle.
-
D.
Menger theorem in graph theory
Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
-
E.
Erdős–Rado theorem
The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.