Turán problems for linear forests and cliques

Tao Fang

Given a graph $T$ and a family of graphs $\mathcal{H}$. The generalized Turán number of $\mathcal{H}$ is the maximum number of copies of $T$ in an $\mathcal{H}$-free graph on $n$ v…