Zhai–Lin–Shu spectral Turán conjecture for books
Let denote the graph consisting of triangles sharing a common edge, and let be the spectral radius of a graph . A graph is -free if it contains no copy of . Zhai–Lin–Shu's conjecture. Let be a -free graph on edges, where for sufficiently large . Then
with equality if and only if is a complete bipartite graph. The conjecture was confirmed by Nikiforov's theorem, so it is solved.
References
Primary source
Ruifang Liu and Lu Miao, “Spectral Turán problem of non-bipartite graphs: Forbidden books”, arXiv:2506.04884 (2025).
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.