Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

9.1, p. 108 — knots in Berge graphs have odd paths and antipaths, two of length one

Proved
StrongPerfectGraph.DoubleSplit.knot_odd_lengths

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

double-split-graphp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-bookp2o-v1perfect-graphsstrong-perfect-graph-theorem

Let (P1,P2,Q1,Q2)(P_1, P_2, Q_1, Q_2)(P1​,P2​,Q1​,Q2​) be a knot in a Berge graph GGG. Then P1,P2,Q1,Q2P_1, P_2, Q_1, Q_2P1​,P2​,Q1​,Q2​ all have odd length, and

(∣P1∣=∣P2∣=1) or (∣Q1∣=∣Q2∣=1),\bigl(|P_1| = |P_2| = 1\bigr) \ \text{or}\ \bigl(|Q_1| = |Q_2| = 1\bigr),(∣P1​∣=∣P2​∣=1) or (∣Q1​∣=∣Q2​∣=1),

where ∣P∣|P|∣P∣ is the length (number of edges) of a path or antipath.

Consequently a knot in a Berge graph is a degenerate appearance of K4K_4K4​ in GGG or in G‾\overline{G}G.

Preamble
import Mathlib
import Definitions.Def_StrongPerfectGraph_Main_IsBerge
import Definitions.Def_StrongPerfectGraph_DoubleSplit_IsKnot
Formal statement
namespace StrongPerfectGraph.DoubleSplit

/-- 9.1 (p. 108): in a knot `(P₁, P₂, Q₁, Q₂)` of a Berge graph all four paths and antipaths have
odd length, and either `P₁, P₂` both have length one or `Q₁, Q₂` both have length one. The length
of a list is its number of vertices minus one. -/
theorem knot_odd_lengths {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (hG : StrongPerfectGraph.Main.IsBerge G) (P₁ P₂ Q₁ Q₂ : List V) (hK : IsKnot G P₁ P₂ Q₁ Q₂) :
    (Odd (P₁.length - 1) ∧ Odd (P₂.length - 1) ∧ Odd (Q₁.length - 1) ∧ Odd (Q₂.length - 1)) ∧
    ((P₁.length - 1 = 1 ∧ P₂.length - 1 = 1) ∨ (Q₁.length - 1 = 1 ∧ Q₂.length - 1 = 1)) := by sorry

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