Erdős–Rado theorem
E1173844
UNEXPLORED
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Erdős–Rado theorem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T15741747 — 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: Erdős–Rado theorem Context triple: [Ramsey theory, hasCentralConcept, Erdős–Rado theorem]
-
A.
Graham–Rothschild theorem
The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
-
B.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
C.
Erdős–Stone theorem
The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
-
D.
Turán's theorem
Turán's theorem is a fundamental result in extremal graph theory that determines the maximum number of edges a graph can have without containing a complete subgraph of a given size.
-
E.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
- 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: Erdős–Rado theorem Target entity description: 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.
-
A.
Graham–Rothschild theorem
The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
-
B.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
C.
Erdős–Stone theorem
The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
-
D.
Turán's theorem
Turán's theorem is a fundamental result in extremal graph theory that determines the maximum number of edges a graph can have without containing a complete subgraph of a given size.
-
E.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.