Spectral Turán conjecture for non-bipartite books
Spectral Turán conjecture for non-bipartite 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 . Let be the graph obtained from by adding an edge within its independent set. Non-bipartite book conjecture. If is a non-bipartite -free graph with edges, then
with equality if and only if . This conjecture concerns the spectral extremal graph among non-bipartite book-free graphs; the source proposes it without giving a resolution.
Sources & referencesView supporting material
Primary source
Ruifang Liu and Lu Miao, “Spectral Turán problem of non-bipartite graphs: Forbidden books”, arXiv:2506.04884 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.