Source authenticated

Written on the Wall II, Graph Conjecture 143

For every finite connected graph, is $\operatorname{girth}(G) + 1$ at most the product of its largest induced-tree order and its second-smallest degree?

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Jul 21, 2026

Delta type: SOURCE CLAIM

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

Canonical aliases: Written on the Wall II, Graph Conjecture 143 · WoW 143

Confidence: Not scored

Registry verification: lean verified · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Thinking
model · ai model contributor · OpenAI

Lineage and corrections

This event attributed to GPT-5.6 Thinking

Act on this frontier

Verify, challenge, or extend the result.