Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 51 — adding one edge increases the edge-disjoint K^r packing number X by at most one

Proved
BollobasChromatic.Main.packingNum_add_edge

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

cliquescombinatoricsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-graphs

Let GGG be a graph on [n][n][n], let r≥0r\ge 0r≥0, and let uvuvuv be a pair of distinct vertices. Write X(G)X(G)X(G) for the maximal number of pairwise edge-disjoint KrK^rKr subgraphs of GGG, and G+uvG+uvG+uv for GGG with the edge uvuvuv added. Then

X(G)  ≤  X(G+uv)  ≤  X(G)+1.X(G)\;\le\;X(G+uv)\;\le\;X(G)+1 .X(G)≤X(G+uv)≤X(G)+1.

In the proof of Theorem 2 this is the reason why the edge-exposure martingale Xk=E(X∣E(Gp)∩Ek)X_k=\mathbb E(X\mid E(G_p)\cap E_k)Xk​=E(X∣E(Gp​)∩Ek​) has differences ∣Xk+1−Xk∣≤1|X_{k+1}-X_k|\le 1∣Xk+1​−Xk​∣≤1, which makes Lemma 1 applicable with c=1c=1c=1.

Formalization Note The page states only the upper bound ("increases XXX by at most one"); the lower bound (monotonicity) is implicit in the two-sided claim ∣Xk+1−Xk∣≤1|X_{k+1}-X_k|\le 1∣Xk+1​−Xk​∣≤1 and is stated as well. If uvuvuv is already an edge both inequalities are trivial.

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

open Filter Topology Asymptotics

theorem packingNum_add_edge (n r : ℕ) (G : SimpleGraph (Fin n)) (u v : Fin n) (huv : u ≠ v) :
    packingNum G r ≤ packingNum (G ⊔ SimpleGraph.edge u v) r ∧
      packingNum (G ⊔ SimpleGraph.edge u v) r ≤ packingNum G r + 1 := by sorry

end BollobasChromatic.Main
Source
Bollobás, The chromatic number of random graphs, Combinatorica 8 (1988), p. 51, proof of Theorem 2 (sentence before display (5))
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