Erdős–Rado theorem
Erdős–Rado theorem is a theorem in combinatorial set theory.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2399838001
- Described as
- theorem in combinatorial set theory
- What it is
- theorem
- Named after
- Paul Erdős; Richard Rado
- Wikipedias with a page
- 5
Wikidata item Q1366581 (wikidata.org/wiki/Q1366581), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1382049847
In partition calculus, part of combinatorial set theory, a branch of mathematics, the Erdős–Rado theorem is a basic result extending Ramsey's theorem to uncountable sets. It is named after Paul Erdős and Richard Rado. It is sometimes also attributed to Đuro Kurepa who proved it under the additional assumption of the generalised continuum hypothesis, and hence the result is sometimes also referred to as the Erdős–Rado–Kurepa theorem.
From the Wikipedia article “Erdős–Rado theorem” (en.wikipedia.org/wiki/Erdős–Rado_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
