Spielman's Laplacian eigenratio conjecture is disproved for infinitely many d>2 using Ramanujan graphs but verified for d≤2 and regular graphs, with stronger results and resolutions of two other conjectures.
Unsolved problems in spectral graph theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Spielman's Laplacian Eigenratio Conjecture and Related Problems
Spielman's Laplacian eigenratio conjecture is disproved for infinitely many d>2 using Ramanujan graphs but verified for d≤2 and regular graphs, with stronger results and resolutions of two other conjectures.