Name
Abstract | ||
|---|---|---|
The Turán function ex(n, F) denotes the maximal number of edges in an F-free graph on n vertices. However if e>ex(n,F), many copies of F appear. We study the function hF(n, q), the minimal number of copies of F in a graph on n vertices with ex(n, F) + q edges. The value of hF(n, q) has been extensively studied when F is colour critical. In this paper we consider a simple non-colour-critical graph, namely the bowtie and establish bounds on hF (n, q) for different ranges of q. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.07.023 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Extremal graph theory,Removal lemma,Supersaturation,Turán function | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Bipartite graph,Mathematics,Path graph | Journal |
Volume | ISSN | Citations |
61 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihyun Kang | 1 | 163 | 29.18 |
| Tamás Makai | 2 | 3 | 2.17 |
| Oleg Pikhurko | 3 | 318 | 47.03 |