Generalized Tur\'an problems for complete bipartite graphs
Combinatorics
2021-05-12 v2
Abstract
For graph , and integer , the generalized Tu\'an number denotes the maximum number of copies of that an -free -vertex graph can have. We study this parameter when both and are complete bipartite graphs.
Keywords
Cite
@article{arxiv.2101.08094,
title = {Generalized Tur\'an problems for complete bipartite graphs},
author = {Dániel Gerbner and Balázs Patkós},
journal= {arXiv preprint arXiv:2101.08094},
year = {2021}
}