Written on the Wall II, Graph Conjecture 2

Precise statement

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)$?

The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.

What AI did

AlphaProof Nexus

Solved autonomously by AlphaProof Nexus, with the proof formally verified in Lean.

Provider: Google DeepMind · Prompt public: unknown · Independence: unknown

Verification boundary

lean verified statement audited

Lean-checked; formal proofs published with DeepMind's AlphaProof Nexus report (arXiv:2605.22763) and its accompanying repository.

Correctness: supported · statement fidelity: audited · peer review: none

Timeline

1. 2026-05-21

   arXiv:2605.22763 - AlphaProof Nexus report

   VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Known method families

argument (source-reported)

Source-reported tools: argument.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

• VibeMath has not independently verified the mathematical claim.
• AI-attempt independence and training-data exposure are unknown unless explicitly documented.
• VibeMath has not independently audited the mathematical statement, proof, or novelty claim.