lean artifact · passed
Artifact ↗Source authenticated
Written on the Wall II, Graph Conjecture 2
For a finite connected graph $G$, let $L_s(G)$ be the maximum number of leaves in a spanning tree and $\ell(G)$ the average local independence number. Must $L_s(G) \ge 2(\ell(G) - 1)$?
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: May 21, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Written on the Wall II, Graph Conjecture 2 · WoW Conjecture 2
Confidence: Not scored
Registry verification: lean verified · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
AlphaProof Nexus
model · ai model contributor · Google DeepMind
Artifacts and verifiers
Compute record
No linked compute attempts recorded.
Lineage and corrections
This event attributed to AlphaProof Nexus