Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

7.1, p. 92 — three internally disjoint tracks through prescribed edges in a 3-connected graph

Proved
StrongPerfectGraph.LineGraph.three_tracks

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

graph-theoryp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let c1,c2c_1, c_2c1​,c2​ be adjacent vertices of a 333-connected graph JJJ, and let e=c1xe = c_1xe=c1​x and f=c1yf = c_1yf=c1​y be two distinct edges of JJJ incident with c1c_1c1​ and different from c1c2c_1c_2c1​c2​. Then there are three tracks of JJJ from c1c_1c1​ to c2c_2c2​, pairwise vertex-disjoint except for their ends, whose first edges are c1c2c_1c_2c1​c2​, eee and fff respectively.

The lemma is used to build prisms around a branch of an appearance in the rung-replacement argument of §7.

Formalization Note The track with first edge c1c2c_1c_2c1​c2​ is the edge c1c2c_1c_2c1​c2​ itself; the other two are c1,x,…,c2c_1, x, \dots, c_2c1​,x,…,c2​ and c1,y,…,c2c_1, y, \dots, c_2c1​,y,…,c2​ with disjoint interiors. The page writes "edges e,fe, fe,f"; they are taken distinct, as the conclusion (three tracks pairwise disjoint except for their ends) requires.

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

theorem three_tracks {W : Type*} [Fintype W] (J : SimpleGraph W) (hJ : IsThreeConnected J)
    (c₁ c₂ x y : W) (h₁₂ : J.Adj c₁ c₂) (hx : J.Adj c₁ x) (hy : J.Adj c₁ y)
    (hx₂ : x ≠ c₂) (hy₂ : y ≠ c₂) (hxy : x ≠ y) :
    IsTrack J [c₁, c₂] ∧
      ∃ q r : List W, IsTrack J (c₁ :: x :: q ++ [c₂]) ∧ IsTrack J (c₁ :: y :: r ++ [c₂]) ∧
        ∀ z ∈ x :: q, z ∉ y :: r := by sorry

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