Name
Abstract | ||
|---|---|---|
The Turán function ex(n,F) denotes the maximal number of edges in an F-free graph on n vertices. We consider 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 bipartite or colour-critical. In this paper we investigate the simplest remaining graph F, namely, two triangles sharing a vertex, and establish the asymptotic value of hF(n,q) for q=o(n2). |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejc.2020.103107 | European Journal of Combinatorics |
DocType | Volume | ISSN |
Journal | 88 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihyun Kang | 1 | 163 | 29.18 |
| Tamás Makai | 2 | 3 | 2.17 |
| Oleg Pikhurko | 3 | 318 | 47.03 |