combinatorics / Spectral graph theory
False for general regular graphs: an explicit cubic graph for which every signing produces an eigenvalue outside the Ramanujan interval. is not itself Ramanujan, and the conjecture restricted to Ramanujan base graphs - the form that would yield Ramanujan graphs of every degree by iteration - remains open.
Temporal state
No reconciled state yet.
Append-only history
False for general regular graphs: an explicit cubic graph for which every signing produces an eigenvalue outside the Ramanujan interval. is not itself Ramanujan, and the conjecture restricted to Ramanujan base graphs - the form that would yield Ramanujan graphs of every degree by iteration - remains open.
Research memory
False for general regular graphs: an explicit cubic graph for which every signing produces an eigenvalue outside the Ramanujan interval. is not itself Ramanujan, and the conjecture restricted to Ramanujan base graphs - the form that would yield Ramanujan graphs of every degree by iteration - remains open.
False for general regular graphs: an explicit cubic graph for which every signing produces an eigenvalue outside the Ramanujan interval. is not itself Ramanujan, and the conjecture restricted to Ramanujan base graphs - the form that would yield Ramanujan graphs of every degree by iteration - remains open.
Evidence graph
parent of · event · claim reported