Jovović–Koledin–Stanić spectral-gap conjecture for trees

From papers

Let T(n)\mathcal{T}(n) be the family of trees on nn vertices. For a tree, write λ1\lambda_1 and λ2\lambda_2 for its two largest adjacency eigenvalues, and let DC(k,k,)DC(k,k,\ell) denote a double comet with two equal pendant-path lengths kk and central path length \ell, where 2k+=n2k+\ell=n. Jovović–Koledin–Stanić conjecture. In T(n)\mathcal{T}(n), the spectral gap λ1λ2\lambda_1-\lambda_2 is minimized by a double comet DC(k,k,)DC(k,k,\ell) such that 2k+=n2k+\ell=n. 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

No solutions have been posted yet.