Ghosh–Győri–Paulos–Xiao–Zamora's extremal conjecture for the triangular pyramid TP4TP_4

From papers

Let TP4TP_4 denote the triangular pyramid graph with four levels, and let ex(n,TP4)\operatorname{ex}(n,TP_4) be the maximum number of edges in an nn-vertex graph containing no copy of TP4TP_4. Ghosh–Győri–Paulos–Xiao–Zamora's conjecture. For nn sufficiently large,

ex(n,TP4)=n24+Θ(n4/3).\operatorname{ex}(n,TP_4)=\frac{n^2}{4}+\Theta(n^{4/3}).

This conjecture concerns the asymptotic Turán number of the triangular pyramid graph TP4TP_4; the exact extremal structure and the asserted asymptotic estimate remain unresolved in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yichen Wang and Ervin Győri, “The maximum number of triangles in graphs without the square of a path”, arXiv:2601.09454 (2026).

Solutions 0

No solutions have been posted yet.