On generalized Turán problems with bounded matching number

Yisai Xue, Liying Kang

The generalized Turán number $\mathrm{ex}(n,H,\mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \i…