Survey of generalized Turán problems -- counting subgraphs

Dániel Gerbner, Cory Palmer

For fixed graphs $H$ and $F$, the \emph{generalized Turán number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. T…