Some exact results of the generalized Turán numbers for paths

Doudou Hei, Xinmin Hou, Boyuan Liu

For graphs $H$ and $F$ with chromatic number $\chi (F)=k$, we call $H$ strictly $F$-Turán-good (or $(H,F)$ strictly Turán-good) if the Turán graph $T_{k-1}(n)$ is the unique $F$-free…