7.2 — the three prism paths have the same parity
ProvedStrongPerfectGraph.EvenPrism.prism_paths_same_paritygraph-theoryp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-bookp2o-v1perfect-graphs
Let be the three paths of a prism in a Berge graph . Then
This is the parity fact used to distinguish even and odd prisms.
Preamble
import Definitions.Def_StrongPerfectGraph_EvenPrism_Prism
Formal statement
namespace StrongPerfectGraph.EvenPrism
theorem prism_paths_same_parity {V : Type*} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) (hG : StrongPerfectGraph.Main.IsBerge G) (a b : Fin 3 → V)
(R : Fin 3 → List V) (hR : IsPrism G a b R) :
∀ i j, Even ((R i).length - 1) ↔ Even ((R j).length - 1) := by sorry
end StrongPerfectGraph.EvenPrism
Source
Chudnovsky, Robertson, Seymour & Thomas, The strong perfect graph theorem, Ann. of Math. 164 (2006), https://doi.org/10.4007/annals.2006.164.51, p. 93, 7.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.