@article{5d65643ec4c8436ab6e96c173d5c6cca,
title = "Generalized Tur{\'a}n problems for disjoint copies of graphs",
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.",
keywords = "Disjoint copies, Generalized Tur{\'a}n, Tur{\'a}n numbers",
author = "D{\'a}niel Gerbner and Abhishek Methuku and M{\'a}t{\'e} Vizer",
note = "Research of Vizer was supported by the J{\'a}nos Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office — NKFIH , grants SNN 116095 , SNN129364 and KH 130371 . We are grateful to an anonymous reviewer for giving us many helpful comments. Research of Gerbner was supported by the J?nos Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office ? NKFIH, grant K 116769. Research of Methuku was supported by the National Research, Development and Innovation Office ? NKFIH, grant K 116769. Research of Vizer was supported by the J?nos Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office ? NKFIH, grants SNN 116095, SNN129364 and KH 130371. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. Research of Gerbner was supported by the J{\'a}nos Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office — NKFIH , grant K 116769 .",
year = "2019",
month = nov,
doi = "10.1016/j.disc.2019.06.022",
language = "English (US)",
volume = "342",
pages = "3130--3141",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "11",
}