Indexed metadata
A 3-regular counterexample to the Bilu--Linial signing conjecture
Zhiqiang Xu
Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.