Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

8.1, p. 99 — all uv-rungs of a strip system have the same parity

Proved
StrongPerfectGraph.LineGraph.rung_parity

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

graph-theoryline-graphsp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-bookp2o-v1perfect-graphs

Let (S,N)(S, N)(S,N) be a JJJ-strip system in a Berge graph GGG, where JJJ is 333-connected. Then for every edge uvuvuv of JJJ, all uvuvuv-rungs have lengths of the same parity:

∣R∣≡∣R′∣(mod2)for all uv-rungs R,R′.|R| \equiv |R'| \pmod 2 \quad \text{for all $uv$-rungs } R, R'.∣R∣≡∣R′∣(mod2)for all uv-rungs R,R′.

Hence any choice of one rung per edge of JJJ induces the line graph of a bipartite subdivision of JJJ.

Preamble
import Mathlib
import Definitions.Def_StrongPerfectGraph_Main_IsBerge
import Definitions.Def_StrongPerfectGraph_LineGraph_IsSubdivision
import Definitions.Def_StrongPerfectGraph_LineGraph_IsStripSystem
Formal statement
namespace StrongPerfectGraph.LineGraph

theorem rung_parity {V W : Type*} [Fintype V] [Fintype W]
    (G : SimpleGraph V) (hG : StrongPerfectGraph.Main.IsBerge G) (J : SimpleGraph W) (hJ : IsThreeConnected J)
    (S : W → W → Set V) (N : W → Set V) (hSN : IsStripSystem J G S N) :
    ∀ u v : W, J.Adj u v → ∀ R R' : List V, IsRung G S N u v R → IsRung G S N u v R' →
      (R.length - 1) % 2 = (R'.length - 1) % 2 := by sorry

end StrongPerfectGraph.LineGraph
Source
Chudnovsky, Robertson, Seymour & Thomas, The strong perfect graph theorem, Ann. of Math. 164 (2006), p. 99, 8.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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