Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:extremal_graph_theory
cycle-free graphs |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sós–Turán theorem
|
| gptkbp:namedAfter |
gptkb:Vera_T._Sós
gptkb:Paul_Erdős gptkb:Paul_Turán |
| gptkbp:publicationYear |
1954
|
| gptkbp:publishedIn |
gptkb:Acta_Mathematica_Academiae_Scientiarum_Hungaricae
|
| gptkbp:state |
The maximum number of edges in a graph with n vertices and no cycle of length k or more is at most (k-2)n/2.
|
| gptkbp:bfsParent |
gptkb:Vera_T._Sós
|
| gptkbp:bfsLayer |
6
|