Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 15 — no vertex of X has a neighbor in S

Proved
P7ThreeColor.Lemma11.X_no_nbr_in_S

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

graph-theorylist-coloringp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1p7-free

Let GGG, LLL and SSS satisfy the hypotheses of Lemma 11, and let XXX be the set of vertices with ∣L(v)∣=3|L(v)| = 3∣L(v)∣=3. Then

no vertex of X is adjacent to a vertex of S.\text{no vertex of } X \text{ is adjacent to a vertex of } S.no vertex of X is adjacent to a vertex of S.

Together with the anticompleteness hypothesis of Lemma 11, this confines the neighborhood of each x∈Xx \in Xx∈X to N(S)∪XN(S) \cup XN(S)∪X, and since XXX is stable, to N(S)N(S)N(S).

Preamble
import Mathlib
import Definitions.Def_P7ThreeColor_Lemma11_Setting
Formal statement
namespace P7ThreeColor.Lemma11

/-- p. 15: under the hypothesis of Lemma 11, no vertex of `X` has a neighbor in `S`. -/
theorem X_no_nbr_in_S {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (L : V → Finset (Fin 3)) (S : Finset V) (hyp : Lemma11Hyp G L S)
    (x s : V) (hx : x ∈ X L) (hs : s ∈ S) :
    ¬ G.Adj x s := by sorry

end P7ThreeColor.Lemma11
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. 15, §3.1, second paragraph ("By the same hypothesis, no vertex of X has neighbors in S.")
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