Name
Abstract | ||
|---|---|---|
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n,H,F). We investigate the function ex(n,H,kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cases when F is a complete graph, cycle or a complete bipartite graph. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2019.06.022 | Discrete Mathematics |
Keywords | DocType | Volume |
Turán numbers,Disjoint copies,Generalized Turán | Journal | 342 |
Issue | ISSN | Citations |
11 | 0012-365X | 4 |
PageRank | References | Authors |
0.48 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Abhishek Methuku | 2 | 4 | 0.82 |
| Máté Vizer | 3 | 27 | 14.06 |