Stability from graph symmetrization arguments in generalized Turán problems

Dániel Gerbner, Hilal Hama Karim

Given graphs $H$ and $F$, $\mathrm{ex}(n,H,F)$ denotes the largest number of copies of $H$ in $F$-free $n$-vertex graphs. Let $\chi (H)<\chi (F)=r+1$. We say that $H$ is $F$-Turán-stable i…