Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Corollary 5, p. 6 — the three inner vertices of a P₅

Proved
P7ThreeColor.Seed.p5_case

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

dominating-setgraph-theoryinduced-pathp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite simple graph and let SSS be a connected dominating set whose induced subgraph is isomorphic to the path P5P_5P5​. Then there is a connected set T⊆ST\subseteq ST⊆S of exactly three vertices that 2-dominates GGG:

∣T∣=3,Tˉ‾=V(G).|T|=3,\qquad \overline{\bar T}=V(G).∣T∣=3,Tˉ=V(G).

This is the path case in the proof of Corollary 5.

Formalization Note Under the path isomorphism, TTT is the image of the three non-leaf vertices. The Lean statement asserts the existence of such a set and carries the induced-subgraph isomorphism as a hypothesis.

Preamble
import Mathlib
import Definitions.Def_P7ThreeColor_Seed_Basic
Formal statement
namespace P7ThreeColor.Seed

/-- Proof of Corollary 5, p. 6: the inner vertices of an induced `P₅` work. -/
theorem p5_case {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (S : Finset V)
    (hS : IsDominating G S) (hSconn : (G.induce (S : Set V)).Connected)
    (e : G.induce (S : Set V) ≃g SimpleGraph.pathGraph 5) :
    ∃ T : Finset V, T.card = 3 ∧ T ⊆ S ∧
      (G.induce (T : Set V)).Connected ∧ IsTwoDominating G T := by sorry

end P7ThreeColor.Seed
Source
Bonomo, Chudnovsky, Maceli, Schaudt, Stein and Zhong, Three-coloring and list three-coloring of graphs without induced paths on seven vertices, Combinatorica (2017), DOI 10.1007/s00493-017-3553-8, p. 6, proof of Corollary 5, P₅ case
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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