The Turán Number of the Triangular Pyramid of $3$-Layers

Debarun Ghosh, Ervin Győri, Addisu Paulos +2

The Turán number of a graph $H$, denoted by $\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not have $H$ as a subgraph. Let $T{P}_k$ be the triangu…