Proposition 4.2: on every admissible tree has at most vertices
ProvedRGMISFast.proposition_4_2graph-theorylocal-computationp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandomized-greedy-mis
There is an absolute constant with the following property. Let be a finite simple graph with all degrees at most , root , and distinct ranks , let , and suppose the ranks lie in the good event (the conclusions of Lemmas 3.1, 3.2 and A.1 at ). Then every admissible tree satisfies
Combined with Observation 2.2 and eq. (12), this gives the tail bound of Theorem 1.1.
Formalization Note is chosen before the vertex type, the graph and all other data. The statement is deterministic: it holds for every rank vector in .
Differences from the source:
- encoding: distinct ranks r : V → [0, ∞), the paper's standing assumption (§1.1, p.2; §2, p.10) → hypotheses
Function.Injective rand∀ v, 0 ≤ r v; reason: the standing assumption written as hypotheses; it holds almost surely - encoding: conditioned on E_h → for every rank vector satisfying
GoodEvent G Δ u (h + 8); reason: a deterministic statement on the event, as in the proof
Preamble
import Mathlib import Definitions.Def_RGMISFast_AdmissibleTree import Definitions.Def_RGMISFast_GoodEvent set_option autoImplicit false open MeasureTheory ProbabilityTheory open scoped ENNReal
Formal statement
namespace RGMISFast
/-- Proposition 4.2 (Dalirrooyfard, Makarychev, Mitrović, Ramachandran, *Randomized Greedy MIS Is Fast at Every Node*,
STOC 2027 submission (manuscript sha256 e93cdfec…), p.16): conditioned on `E_h`, every admissible tree has at most
`C∗∆^90(1 + h)` vertices, where `C∗` is an absolute constant.
**Formalization Note** `C∗` is chosen before the graph and all other data. `E_h` is
`GoodEvent G Δ u (h + 8)` (`L = h + 8`, `h ≥ 0`, "Throughout this section, L = h + 8, for an
h ≥ 0", p.15). The statement is deterministic: for every rank vector in `E_h`, with distinct
nonnegative ranks (the standing assumption of §2), all degrees at most `∆`, `∆ ≥ 2`. -/
theorem proposition_4_2 : ∃ Cstar : ℝ, 0 < Cstar ∧
∀ (V : Type) [Fintype V] [LinearOrder V] (G : SimpleGraph V) [DecidableRel G.Adj] (Δ : ℕ),
2 ≤ Δ → (∀ v, G.degree v ≤ Δ) → ∀ (u : V) (h : ℝ), 0 ≤ h →
∀ r : V → ℝ, Function.Injective r → (∀ v, 0 ≤ r v) → GoodEvent G Δ u (h + 8) r →
∀ T : AdmissibleTree G r u, (T.nodes.card : ℝ) ≤ Cstar * (Δ : ℝ) ^ 90 * (1 + h) := by sorry
end RGMISFast
Source
Dalirrooyfard, Makarychev, Mitrović, Ramachandran, Randomized Greedy MIS Is Fast at Every Node, STOC 2027 submission (manuscript sha256 e93cdfecc03618969d5f2ecf8171c6f84c528edcc473b2f864299e555f823664), Proposition 4.2, p.16 (PDF p.18); L = h + 8, p.15
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.