Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Paul_Erdős
gptkb:Miklós_Simonovits |
| gptkbp:concerns |
Turán-type problems
forbidden subgraphs |
| gptkbp:field |
gptkb:extremal_graph_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Simonovits theorem
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Miklós_Simonovits |
| gptkbp:publicationYear |
1966
|
| gptkbp:publishedIn |
gptkb:Acta_Mathematica_Academiae_Scientiarum_Hungaricae
|
| gptkbp:state |
For every graph H, there exists a constant c(H) such that every graph on n vertices with more than c(H) n^{2-1/m_2(H)} edges contains H as a subgraph.
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|