Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A minimum imperfect graph admits no proper homogeneous pair

Open
StrongPerfectGraph.Main.minimum_imperfect_no_proper_homogeneous_pair

by tianyipeng · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryperfect-graphs

Let GGG be a minimum imperfect graph: a Berge graph that is not perfect, such that every Berge graph with fewer vertices is perfect. Then GGG admits no proper homogeneous pair:

G minimum imperfect ⟹ G admits no proper homogeneous pair.G\ \text{minimum imperfect}\ \Longrightarrow\ G\ \text{admits no proper homogeneous pair}.G minimum imperfect ⟹ G admits no proper homogeneous pair.

Here a proper homogeneous pair is a pair (A,B)(A,B)(A,B) of disjoint nonempty vertex sets such that, writing A1,A2A_1,A_2A1​,A2​ for the sets of AAA-complete and AAA-anticomplete vertices and B1,B2B_1,B_2B1​,B2​ similarly, we have A1∪A2=B1∪B2=V(G)∖(A∪B)A_1\cup A_2=B_1\cup B_2=V(G)\setminus(A\cup B)A1​∪A2​=B1​∪B2​=V(G)∖(A∪B) and the four sets A1∩B1A_1\cap B_1A1​∩B1​, A1∩B2A_1\cap B_2A1​∩B2​, A2∩B1A_2\cap B_1A2​∩B1​, A2∩B2A_2\cap B_2A2​∩B2​ are all nonempty.

The paper attributes this to Chvátal and Sbihi (reference [7], Bull-free Berge graphs are perfect, Graphs Combin. 3 (1987), 127–139) in the proof of 1.2 assuming 1.3: "It is shown in [7] that G does not admit a proper homogeneous pair." It is one of the ingredients used to rule out every outcome of the decomposition theorem 1.3 for a minimum imperfect graph.

Formalization Note IsMinimumImperfect and IsProperHomogeneousPair are the mission definitions.

Preamble
import Mathlib
import Definitions.Def_StrongPerfectGraph_Main_IsMinimumImperfect
import Definitions.Def_StrongPerfectGraph_Main_IsProperHomogeneousPair
Formal statement
namespace StrongPerfectGraph.Main

/-- Chvátal–Sbihi: a minimum imperfect graph admits no proper homogeneous pair (p. 56). -/
theorem minimum_imperfect_no_proper_homogeneous_pair {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (hG : IsMinimumImperfect G) : ¬ IsProperHomogeneousPair G := by sorry

end StrongPerfectGraph.Main
Source
Chudnovsky, Robertson, Seymour & Thomas, The strong perfect graph theorem, Ann. of Math. 164 (2006), 51-229, p. 56, proof of 1.2 assuming 1.3 ("It is shown in [7] that G does not admit a proper homogeneous pair"), citing Chvatal & Sbihi, Bull-free Berge graphs are perfect, Graphs Combin. 3 (1987) 127-139

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