Generalized Turán problems for disjoint copies of graphs

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 comple...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 342; no. 11; pp. 3130 - 3141
Main Authors Gerbner, Dániel, Methuku, Abhishek, Vizer, Máté
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.11.2019
Subjects
Disjoint copies
Generalized Turán
Turán numbers
Disjoint copies
Turán numbers
Generalized Turán
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2019.06.022