fundamental theorem of extremal graph theory
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Turán's_theorem
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:describes |
maximum number of edges in a graph without a complete subgraph of given size
|
| gptkbp:field |
gptkb:extremal_graph_theory
graph theory |
| gptkbp:formedBy |
gptkb:Pál_Turán
|
| https://www.w3.org/2000/01/rdf-schema#label |
fundamental theorem of extremal graph theory
|
| gptkbp:influenced |
modern extremal combinatorics
|
| gptkbp:relatedTo |
gptkb:Turán_graph
gptkb:Erdős–Stone_theorem |
| gptkbp:state |
The maximum number of edges in an n-vertex graph that does not contain a (r+1)-clique is achieved by the Turán graph T(n, r).
|
| gptkbp:yearProposed |
1941
|
| gptkbp:bfsParent |
gptkb:Erdős–Stone_theorem
|
| gptkbp:bfsLayer |
5
|