Name
Abstract | ||
|---|---|---|
The Turán function ex(n,F) of a graph F is the maximum number of edges in an F-free graph with n vertices. The classical results of Turán and Rademacher from 1941 led to the study of supersaturated graphs where the key question is to determine hF(n,q), the minimum number of copies of F that a graph with n vertices and ex(n,F)+q edges can have. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jctb.2016.12.001 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Extremal graph theory,Removal lemma,Supersaturation,Turán function | Journal | 123 |
ISSN | Citations | PageRank |
0095-8956 | 4 | 0.50 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |
| Zelealem B. Yilma | 2 | 32 | 5.32 |