Counting triangles in graphs without suspensions of paths

Chunyang Dou, Xing Peng

For a graph $H$, the suspension $\hat{H}$ of $H$ is a graph obtained from $H$ by joining a new vertex to every vertex of $H$. The generalized Turán number $\textrm{ex}(n,K_3,\wi…