Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every root-connected set has a depth-first spanning-tree code

Open
RGMISFast.root_connected_tree_code_exists

by srikkanthr · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryrandomized-greedy-mis

Let a finite simple graph have every degree at most Δ\DeltaΔ, and fix a root. Every root-connected vertex set AAA of size j+1j+1j+1 is the decoded visited set of some traversal code with 2j2j2j binary descent/return commands and jjj neighbour indices, each smaller than Δ\DeltaΔ.

This is the spanning-tree encoding step in the proof of Lemma A.2. It is a structural existence statement about the explicit decoder; the bound on the number of codes is proved separately. There is no lower bound on Δ\DeltaΔ or jjj.

Formalization note. The ordered tree in the paper is represented by its depth-first binary word and edge labels. The conclusion asserts decoding completeness, rather than introducing an abstract injection based on a cardinality assumption.

Preamble
import Definitions.Def_RGMISFast_rootedTreeCode
import Definitions.Def_RGMISFast_IsRootConnected
open RGMISFast
set_option autoImplicit false
Formal statement
theorem RGMISFast.root_connected_tree_code_exists {V : Type*} [Fintype V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (Δ : ℕ)
    (hdeg : ∀ v, G.degree v ≤ Δ) (u : V) (j : ℕ)
    (A : Finset V) (hA : IsRootConnected G u A) (hcard : A.card = j+1) :
    ∃ (shape : Fin (2*j) → Bool) (labels : Fin j → Fin Δ),
      rootedTreeCode G Δ u j shape labels = A := by sorry
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, Appendix A, proof of Lemma A.2, printed p.29 (PDF p.31), manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me