Ghosh–Győri–Paulos–Xiao–Zamora's extremal conjecture for the triangular pyramid
Let denote the triangular pyramid graph with four levels, and let be the maximum number of edges in an -vertex graph containing no copy of . Ghosh–Győri–Paulos–Xiao–Zamora's conjecture. For sufficiently large,
This conjecture concerns the asymptotic Turán number of the triangular pyramid graph ; the exact extremal structure and the asserted asymptotic estimate remain unresolved in the source.
References
- Yichen Wang and Ervin Győri, “The maximum number of triangles in graphs without the square of a path”, arXiv:2601.09454 (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.