§3.1, p. 15 — a vertex of S adjacent to d ∈ Dᵢ has list {i}
ProvedP7ThreeColor.Lemma11.list_of_seed_nbrgraph-theorylist-coloringp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1p7-free
Let , and satisfy the hypotheses of Lemma 11, and let be the set of vertices with . Then for every and every adjacent to ,
This fixes the color of every vertex of next to , and is what makes the inner vertices of the paths in Claim 12 non-adjacent to the "wrong" sets .
Preamble
import Mathlib import Definitions.Def_P7ThreeColor_Lemma11_Setting
Formal statement
namespace P7ThreeColor.Lemma11
/-- p. 15: under the hypothesis of Lemma 11, for every `d ∈ D_i` and every `s ∈ S ∩ N(d)`,
`L(s) = {i}`. -/
theorem list_of_seed_nbr {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
(L : V → Finset (Fin 3)) (S : Finset V) (hyp : Lemma11Hyp G L S)
(i : Fin 3) (d s : V) (hd : d ∈ D G L S i) (hs : s ∈ S) (hds : G.Adj d s) :
L s = {i} := 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 ("Observe that, under the hypothesis of Lemma 11, ...")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.