The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices

Doudou Hei, Xinmin Hou, Yue Ma

Given graphs $H$ and $F$, the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of $H$ in an $n$-vertex graph that contains no copy of $F$. The sus…