Jovović–Koledin–Stanić spectral-gap conjecture for trees
Jovović–Koledin–Stanić spectral-gap conjecture for trees
Let be the family of trees on vertices. For a tree, write and for its two largest adjacency eigenvalues, and let denote a double comet with two equal pendant-path lengths and central path length , where . Jovović–Koledin–Stanić conjecture. In , the spectral gap is minimized by a double comet such that . The conjecture concerns the extremal structure of the spectral gap among trees and is part of the broader study of combinations of the first two eigenvalues. The supplied context gives no resolution, so its status remains open.
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
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada and Hanmeng Zhan, “Convex combination of first and second eigenvalues of trees”, arXiv:2601.10036 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.