Turán problems for suspension of a balanced tree

Xiutao Zhu, Xiaolin Wang, Yanbo Zhang +1

The Turán number $\ex(n,H)$ is the maximum number of edges that an $n$-vertex $H$-free graph can have. The suspension $\hat{H}$ is obtained from $H$ by adding a new vertex whic…