Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:fundamental_theorem_of_extremal_graph_theory
|
| gptkbp:field |
gptkb:extremal_graph_theory
|
| gptkbp:generalizes |
gptkb:Turán's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Stone theorem
|
| gptkbp:implies |
asymptotic determination of extremal number for non-bipartite graphs
|
| gptkbp:importantFor |
cornerstone of extremal graph theory
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Arthur_Stone |
| gptkbp:publicationYear |
1946
|
| gptkbp:publishedIn |
gptkb:Bulletin_of_the_American_Mathematical_Society
|
| gptkbp:state |
For any integer r ≥ 2 and any ε > 0, every graph on n vertices with more than (1 - 1/(r-1) + ε) n^2/2 edges contains a subgraph isomorphic to Kr(s) for some s.
|
| gptkbp:subjectOf |
graph theory textbooks
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|