2017/12/19 by Dániel Gerbner, Gerbner, Dániel, Abhishek Methuku +3 · 2 citations
Mathematics · #Limits and Structures in Graph Theory #Graph theory and applications #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.1712.07072
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.