Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:describes |
maximum number of edges in a graph without complete subgraph
|
| gptkbp:field |
graph theory
|
| gptkbp:generalizes |
gptkb:Mantel's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turán's theorem
|
| gptkbp:influenced |
gptkb:Erdős–Stone_theorem
|
| gptkbp:namedAfter |
gptkb:Pál_Turán
|
| gptkbp:publishedIn |
gptkb:Mathematika_Lapok
|
| gptkbp:relatedTo |
gptkb:extremal_graph_theory
gptkb:Turán_graph |
| gptkbp:state |
The maximum number of edges in an n-vertex graph without a (r+1)-clique is achieved by the Turán graph T(n,r).
|
| gptkbp:usedIn |
combinatorics
|
| gptkbp:yearProposed |
1941
|
| gptkbp:bfsParent |
gptkb:Erdős–Stone_theorem
|
| gptkbp:bfsLayer |
5
|