AI-found dumbbell graph refutes Graffiti Conjecture 143

A 39-vertex dumbbell graph violates Graffiti Conjecture 143, which bounds the variance of positive adjacency eigenvalues by graph size divided by average distance. The witness works under both standard average-distance conventions.

Sources for this record

What was already known

A 2025 study searched graphs through 100 vertices without finding a counterexample to the conjecture.

AI involvement AI-centered

Claude agents proposed the dumbbell witness in John Erlbacher’s directed Demonstrandum campaign. Erlbacher audited its verification gates.

Claude agents supplied the witness under Erlbacher’s direction; individual-result autonomy is not documented.

Importance Notable

Resolves a longstanding spectral graph conjecture with a small exact witness.

Limitations

The result addresses the stated variance and distance readings. It does not establish a global smallest counterexample; a larger corroborating witness uses floating-point checks only.

Technical verification Formal (exact computation)

Two exact spectral routes and a separate rebuild reportedly certify the finite counterexample.

Independent checking

exact computation

Checker
checker_g143.py exact SymPy and Berkowitz/Sturm routes, with verify_kills.py rebuild
Scope
Dumbbell graph certificates violating Graffiti 143 under both average-distance readings
Basis
Reported by the linked checker
Evidence source

Human understanding Few

No named person explains this individual construction; Few is the evidence default.

Correction and publication history