The Turán number of the triangular pyramid of 4-layers

Hangdi Chen, Yaojun Chen, Xiutao Zhu

The Turán number $ex(n,H)$ of a graph $H$ is the maximum number of edges in any $H$-free graph on $n$ vertices. The triangular pyramid of $k$-layers, denoted by $T{P}_k$, is a genera…