Ghosh et al.'s Turán-number conjecture for the triangular pyramid of 4-layers

Let TP4TP_4 be the triangular pyramid with 44 layers, and let ex(n,TP4)\textup{ex}(n,TP_4) denote the maximum number of edges in an nn-vertex graph containing no copy of TP4TP_4. Ghosh et al.'s conjecture. For sufficiently large nn,

ex(n,TP4)=14n2+Θ(n43).\textup{ex}(n,TP_4)=\frac{1}{4}n^2+\Theta(n^{\frac{4}{3}}).

This conjecture predicts the second-order term in the Turán number of TP4TP_4, extending the known asymptotic result for TP3TP_3. Its resolution is not specified in the source.

Sources & referencesView supporting material

Primary source

Hangdi Chen, Yaojun Chen and Xiutao Zhu, “The Turán number of the triangular pyramid of 4-layers”, arXiv:2602.07484 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.