Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:field |
graph theory
|
| gptkbp:generalizes |
gptkb:Turán's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Mantel's theorem
|
| gptkbp:namedAfter |
gptkb:Willem_Mantel
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Koninklijke_Nederlandse_Akademie_van_Wetenschappen
|
| gptkbp:relatedConcept |
gptkb:extremal_graph_theory
|
| gptkbp:sentence |
The maximum number of edges in a triangle-free simple graph with n vertices is floor(n^2/4).
|
| gptkbp:yearProposed |
1907
|
| gptkbp:bfsParent |
gptkb:Turán's_theorem
|
| gptkbp:bfsLayer |
6
|