Some exact results for non-degenerate generalized Tur\'an problems

Dániel Gerbner

Some exact results for non-degenerate generalized Tur\'an problems

Combinatorics 2022-09-09 v1

Authors: Dániel Gerbner

Abstract

The generalized Tur\'an number $\mathrm{ex}(n,H,F)$ is the maximum number of copies of $H$ in $n$ -vertex $F$ -free graphs. We consider the case where $\chi(H)<\chi(F)$ . There are several exact results on $\mathrm{ex}(n,H,F)$ when the extremal graph is a complete $(\chi(F)-1)$ -partite graph. We obtain multiple exact results with other kinds of extremal graphs.

Keywords

turán theory graph theory

Cite

@article{arxiv.2209.03426,
  title  = {Some exact results for non-degenerate generalized Tur\'an problems},
  author = {Dániel Gerbner},
  journal= {arXiv preprint arXiv:2209.03426},
  year   = {2022}
}

Related papers

View all related →