Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

11.3, p. 129 — in a Berge graph with no even prism, rungs and banisters have odd length

Proved
StrongPerfectGraph.OddPrism.banister_rung_odd

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

p2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-bookp2o-v1perfect-graphsstrong-perfect-graph-theorem

Let GGG be a Berge graph containing no even prism, let S=(A,C,B)S=(A,C,B)S=(A,C,B) be a step-connected strip in GGG, and let a0-R0-b0a_0\text{-}R_0\text{-}b_0a0​-R0​-b0​ be a banister with respect to SSS. Then

every rung of S has odd length, and so does R0.\text{every rung of } S \text{ has odd length, and so does } R_0 .every rung of S has odd length, and so does R0​.

Odd parity of the rungs and of the banister is used throughout Sections 12 and 13, in particular to see that the banister of a staircase has odd length at least 333.

Preamble
import Mathlib
import Definitions.Def_StrongPerfectGraph_OddPrism_IsBerge
import Definitions.Def_StrongPerfectGraph_OddPrism_IsPrism
import Definitions.Def_StrongPerfectGraph_OddPrism_IsStepConnectedStrip
import Definitions.Def_StrongPerfectGraph_OddPrism_IsStaircase
Formal statement
namespace StrongPerfectGraph.OddPrism

/-- **11.3** (p. 129). Let `G` be Berge, containing no even prism, let `S = (A, C, B)` be a
step-connected strip in `G`, and let `a₀-R₀-b₀` be a banister. Then every rung of the strip
has odd length, and so does `R₀`. -/
theorem banister_rung_odd {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (hG : IsBerge G) (hprism : ¬ ContainsEvenPrism G)
    (A C B : Set V) (hS : IsStepConnected G A C B)
    (r₀ : List V) (hr₀ : IsBanister G A C B r₀) :
    (∀ r : List V, IsRung G A C B r → Odd (r.length - 1)) ∧ Odd (r₀.length - 1) := by sorry

end StrongPerfectGraph.OddPrism
Source
Chudnovsky, Robertson, Seymour & Thomas, The strong perfect graph theorem, Ann. of Math. 164 (2006), p. 129, 11.3
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