Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5, p. 6 — a small connected 2-dominating set or a K₄

Proved
P7ThreeColor.Seed.corollary_5

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

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

Let GGG be a finite connected simple graph with no induced path on seven vertices. Then GGG has a connected 2-dominating set of at most three vertices or contains a complete subgraph on four vertices:

(∃S⊆V(G): ∣S∣≤3, G[S] connected, Sˉ‾=V(G))∨K4⊆G.\bigl(\exists S\subseteq V(G):\ |S|\le 3,\ G[S]\text{ connected},\ \overline{\bar S}=V(G)\bigr) \quad\lor\quad K_4\subseteq G.(∃S⊆V(G): ∣S∣≤3, G[S] connected, Sˉ=V(G))∨K4​⊆G.

The result supplies a small structural seed for the paper's graph-coloring analysis whenever the K4K_4K4​ obstruction is absent.

Formalization Note The paper's second sentence, which gives a running time for finding the set or subgraph, is outside this statement because no machine model is part of the mission. A complete subgraph of four vertices is represented by ¬ G.CliqueFree 4; the disjunction is inclusive.

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

/-- First statement of Corollary 5, p. 6. -/
theorem corollary_5 {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (hG : G.Connected) (h7 : PFree 7 G) :
    (∃ S : Finset V, S.card ≤ 3 ∧ (G.induce (S : Set V)).Connected ∧
      IsTwoDominating G S) ∨ ¬ G.CliqueFree 4 := 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, Corollary 5, first sentence
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