Li–Peng square-root booksize conjecture for Nosal graphs
Let be an -edge graph with spectral radius . Such a graph is called Nosal, and let denote the maximum number of triangles sharing a common edge in .
Li–Peng conjecture. For every -edge Nosal graph ,
Nikiforov had previously shown the weaker bound .
References
3 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2601.10163, arXiv:2508.14366.
Status
- Solved: Li, Liu and Zhang. More on Nosal’s spectral theorem: Books and 4-cycles (Journal of Combinatorial Theory, Series B, 179 (2026), 219–249, 2026) https://doi.org/10.1016/j.jctb.2026.03.005
Source: Xinghui Zhao, Lihua You, Jing Zeng and Xiaoxue Zhang, “Two problems on booksize and triangular edges in Nosal graphs”, arXiv:2607.15071 (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.