PureOne/bilu-linial-extensive-spectral-failure-v4
Viewer • Updated • 27 • 368
A finite connected simple cubic graph is constructed whose every edge signing produces an adjacency matrix eigenvalue outside a specified interval, refuting the Bilu–Linial signing conjecture for regular graphs.
We construct a finite connected simple cubic graph F such that every signing of its edges yields an adjacency matrix with an eigenvalue outside [-2sqrt2,2sqrt2]. This disproves the Bilu--Linial signing conjecture for general regular graphs. The proof is elementary, using a four-vertex calculation and a scalar recurrence.
No model linking this paper
No Space linking this paper
No Collection including this paper