Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 53 — if every n₁-set has s independent vertices, then χ(G) ≤ n/s + n₁ (greedy colouring)

Proved
BollobasChromatic.Main.colorable_of_forall_indep

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

chromatic-numbergraph-coloringgraph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a graph on [n][n][n] and let s≥1s\ge 1s≥1 and n1≥0n_1\ge 0n1​≥0 be integers such that every set of n1n_1n1​ vertices of GGG contains sss independent vertices. Then

χ(G)≤⌊ns⌋+n1.\chi(G)\le \Bigl\lfloor\frac ns\Bigr\rfloor+n_1 .χ(G)≤⌊sn​⌋+n1​.

Colouring by repeatedly removing independent sss-sets until fewer than n1n_1n1​ vertices remain gives this bound; with s=s1s=s_1s=s1​ and n1n_1n1​ from the proof of Theorem 4 it gives the upper bound χ(Gp)≤n/s1+n1\chi(G_p)\le n/s_1+n_1χ(Gp​)≤n/s1​+n1​.

Formalization Note The page's bound n/s1+n1n/s_1+n_1n/s1​+n1​ is real; since χ(G)\chi(G)χ(G) is an integer the two forms are equivalent. The hypothesis s≥1s\ge 1s≥1 is implicit on the page (s1→∞s_1\to\inftys1​→∞); for s=0s=0s=0 the claim is false.

Preamble
import Mathlib
import Definitions.Def_BollobasChromatic_Main_Setting
Formal statement
namespace BollobasChromatic.Main

open Filter Topology Asymptotics

theorem colorable_of_forall_indep (n : ℕ) (G : SimpleGraph (Fin n)) (s n1 : ℕ) (hs : 1 ≤ s)
    (hind : ∀ S : Finset (Fin n), S.card = n1 → ∃ T ⊆ S, G.IsNIndepSet s T) :
    G.Colorable (n / s + n1) := by sorry

end BollobasChromatic.Main
Source
Bollobás, The chromatic number of random graphs, Combinatorica 8 (1988), p. 53, proof of Theorem 4 (greedy colouring paragraph)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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