Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
|
| gptkbp:application |
gptkb:network_protocol
computer science discrete mathematics |
| gptkbp:fieldOfStudy |
combinatorics
graph theory |
| gptkbp:focusesOn |
maximum or minimum values of graph parameters
|
| https://www.w3.org/2000/01/rdf-schema#label |
Extremal Graph Theory
|
| gptkbp:notableContributor |
gptkb:Béla_Bollobás
gptkb:Paul_Erdős gptkb:Miklós_Simonovits |
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:Erdős–Stone_theorem gptkb:Turán's_theorem |
| gptkbp:studies |
extremal problems in graphs
|
| gptkbp:type |
What is the maximum number of edges in a graph with n vertices that does not contain a given subgraph?
|
| gptkbp:bfsParent |
gptkb:Béla_Bollobás
gptkb:Bela_Bollobas gptkb:Bela_Bollobás |
| gptkbp:bfsLayer |
6
|