On supersaturation and stability for generalized Turán problems

Anastasia Halfpap, Cory Palmer

Fix graphs $F$ and $H$. Let $\mathrm{ex}(n,H,F)$ denote the maximum number of copies of a graph $H$ in an $n$-vertex $F$-free graph. In this note we will give a new general supersa…