加载中…
We construct a finite connected simple cubic graph such that every signing of its edges yields an adjacency matrix with an eigenvalue outside . This disproves the Bilu–Linial signing conjecture for general regular graphs. The proof is elementary, using a four-vertex calculation and a scalar recurrence.

生成讲解博客的中文版本

生成AI智能校验的中文版本