The asymptotic Turán number conjecture for the triangular pyramid of 4 layers

From papers

Let TP4TP_4 denote the triangular pyramid of 44 layers, 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. Asymptotic Turán number conjecture for TP4TP_4. 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 order of the excess over the balanced bipartite bound, and its resolution is not supplied 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

Debarun Ghosh, Ervin Győri, Addisu Paulos, Chuanqi Xiao and Oscar Zamora, “The Turán Number of the Triangular Pyramid of 3-Layers”, arXiv:2107.10229 (2021).

Solutions 0

No solutions have been posted yet.