Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Corollary 5, p. 6 — a connected P₃-free graph is complete

Proved
P7ThreeColor.Seed.connected_p3free_complete

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

graph-theoryinduced-pathp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1p3-free

Let HHH be a connected simple graph with no induced path on three vertices. Every two distinct vertices of HHH are adjacent:

u≠v⟹uv∈E(H).u\ne v\quad\Longrightarrow\quad uv\in E(H).u=v⟹uv∈E(H).

This is the completeness observation used in the final case of Corollary 5.

Formalization Note No finiteness assumption is required for this observation. Connectedness includes a nonempty vertex set.

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

/-- Proof of Corollary 5, p. 6: a connected `P₃`-free graph is complete. -/
theorem connected_p3free_complete {W : Type*} (H : SimpleGraph W)
    (hH : H.Connected) (h3 : PFree 3 H) :
    ∀ u v : W, u ≠ v → H.Adj u v := 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, final 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