1 problem

Let $TP_4$ denote the triangular pyramid graph with four levels, and let $\operatorname{ex}(n,TP_4)$ be the maximum number of edges in an $n$-vertex graph containing no copy of…