Erdős–Stone theorem
Erdős–Stone theorem is a theorem in extremal graph 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 17, 2026 · revision 2496361939
- Described as
- theorem in extremal graph theory
- What it is
- theorem
- Named after
- Paul Erdős; Arthur Harold Stone
- Wikipedias with a page
- 5
Wikidata item Q5385326 (wikidata.org/wiki/Q5385326), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1322446224
In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946, and it has been described as the “fundamental theorem of extremal graph theory”.
From the Wikipedia article “Erdős–Stone theorem” (en.wikipedia.org/wiki/Erdős–Stone_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; 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.
