Some Exact Results for Non-Degenerate Generalized Turán Problems

  • Dániel Gerbner

Abstract

The generalized Turán 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.

Published
2023-12-15
How to Cite
Gerbner, D. (2023). Some Exact Results for Non-Degenerate Generalized Turán Problems. The Electronic Journal of Combinatorics, 30(4), P4.39. https://doi.org/10.37236/11574
Article Number
P4.39