Source authenticated

Graffiti Conjecture 284

If a finite graph has girth at least five, must its minimum dual degree satisfy $\delta^*(G) \le -\partial_n(G)$, where $\partial_n(G)$ is the smallest eigenvalue of its distance matrix? The Hoffman-Singleton graph violates it: dual degree $7$ against eigenvalue bound $4$.

Exact FrontierDelta

Prior state unknowndisproved

Scope and record

Occurred: Jul 22, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Graffiti Conjecture 284 · Graffiti 284

Confidence: Not scored

Registry verification: unreviewed · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Grok 4.5 Medium (Capy build)
model · ai model contributor · xAI

Lineage and corrections

This event attributed to Grok 4.5 Medium (Capy build)

Act on this frontier

Verify, challenge, or extend the result.