Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1, p. 14 (Caro–Hansen–Sopena) — every graph with n vertices and m edges has α(G) ≥ max{n²/(n + 2m), (2n − m)/3}

Proved
RecMarkovGraph.IndepLB.lemma_5_1

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryindependence-numberp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1turan

Let GGG be a finite simple graph with nnn vertices and mmm edges, and let α(G)\alpha(G)α(G) be its stability number, the largest size of a set of pairwise non-adjacent vertices. Then

α(G) ≥ max⁡{n2n+2m, 2n−m3}.\alpha(G)\ \ge\ \max\Bigl\{\frac{n^2}{n+2m},\ \frac{2n-m}{3}\Bigr\}.α(G) ≥ max{n+2mn2​, 32n−m​}.

The first bound equals n/(1+d(G))n/(1+d(G))n/(1+d(G)) with d(G)=2m/nd(G)=2m/nd(G)=2m/n the average degree; it turns the concentration of the average degree (Theorem 2.2) into the lower bound on α(Gn,pr)\alpha(G^r_{n,p})α(Gn,pr​).

Differences from the source:

  • encoding: any n-vertex graph G with m edges; α(G) → G : SimpleGraph V on a Fintype V, n = Fintype.card V, m = G.edgeFinset.card, α = SimpleGraph.indepNum, all cast to ℝ; reason: the same objects; at n = 0 both sides are 0 (Lean's 0/0 = 0)
Preamble
import Mathlib
import Definitions.Def_RecMarkovGraph_IndepLB_Model
Formal statement
namespace RecMarkovGraph.IndepLB

theorem lemma_5_1 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] :
    max (((Fintype.card V : ℝ)) ^ 2 / ((Fintype.card V : ℝ) + 2 * (G.edgeFinset.card : ℝ)))
        ((2 * (Fintype.card V : ℝ) - (G.edgeFinset.card : ℝ)) / 3) ≤ (G.indepNum : ℝ) := by sorry

end RecMarkovGraph.IndepLB
Source
Gupte, Zhu, Large independent sets in recursive Markov random graphs, arXiv:2207.04514v4, p. 14, Lemma 5.1 (citing Caro, Hansen, Sopena 2003, Theorems 10 and 11)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

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