Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.2, p. 158 — removing consistently precolored lecture-nodes gives Ĝ′: Ĝ has a p-coloring respecting the precoloring iff Ĝ′ is p-colorable

Proved
Timetabling85.CourseColoring.prop_3_2

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

course-schedulinggraph-coloringp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1precoloringtimetabling

Let HHH be a course scheduling graph: its nodes are lecture-nodes VVV and period-nodes 1,…,p1,\dots,p1,…,p, and all pairs of period-nodes are adjacent. Assume some lecture-nodes have been precoloured: a precoloured node vvv must receive the colour of the period-node k(v)k(v)k(v). Assume the precolouring is consistent:

  1. no precoloured node vvv is adjacent to its own period-node k(v)k(v)k(v), and
  2. no two adjacent lecture-nodes are precoloured with the colour of the same period-node.

Let G^′\hat G'G^′ be obtained from HHH by removing every precoloured node vvv and linking each of its remaining neighbours with the period-node k(v)k(v)k(v); G^′\hat G'G^′ has no precoloured node. Then

H has a node coloring with p colors respecting the precoloring  ⟺  G^′ has a node coloring with p colors.H \text{ has a node coloring with } p \text{ colors respecting the precoloring} \iff \hat G' \text{ has a node coloring with } p \text{ colors}.H has a node coloring with p colors respecting the precoloring⟺G^′ has a node coloring with p colors.

For node colouring, unlike edge colouring, preassignments therefore do not make the problem harder: they can be absorbed into the graph.

Formalization Note The consistency hypotheses are an addition to the page, and a necessary one: if two adjacent lecture-nodes are precoloured with the same colour, HHH has no respecting colouring, but removing both deletes the edge between them and G^′\hat G'G^′ may be ppp-colourable (two adjacent lecture-nodes and one period-node, p=1p = 1p=1). The proof on the page also speaks of a 1–1 correspondence between the colourings; with precolours read as fixed absolute colours this fails (colourings of G^′\hat G'G^′ may permute the colours of the period-nodes), so only the equivalence of the proposition is stated. "Precoloured" is read relative to the period-nodes (c(v)=c(k(v))c(v) = c(k(v))c(v)=c(k(v))), as in the proof of Proposition 3.1; since the period-nodes form a clique on ppp nodes, this is equivalent to precolouring with absolute colours up to a permutation of the palette. HHH is any graph with this shape; the graph G^\hat GG^ of Proposition 3.1 is one.

Preamble
import Mathlib
import Definitions.Def_Timetabling85_CourseColoring_CSUP
Formal statement
namespace Timetabling85.CourseColoring

theorem prop_3_2 {V : Type*} {p : ℕ} (H : SimpleGraph (V ⊕ Fin p)) (pc : V → Option (Fin p))
    (hclique : ∀ k k' : Fin p, k ≠ k' → H.Adj (Sum.inr k) (Sum.inr k'))
    (hcons_period : ∀ (v : V) (k : Fin p), pc v = some k → ¬ H.Adj (Sum.inl v) (Sum.inr k))
    (hcons_lecture : ∀ (v v' : V) (k : Fin p), pc v = some k → pc v' = some k →
      ¬ H.Adj (Sum.inl v) (Sum.inl v')) :
    (∃ c : H.Coloring (Fin p), ∀ (v : V) (k : Fin p), pc v = some k →
        c (Sum.inl v) = c (Sum.inr k)) ↔
      (removePrecolored H pc).Colorable p := by sorry

end Timetabling85.CourseColoring
Source
de Werra, An introduction to timetabling, Eur. J. Oper. Res. 19 (1985), p. 158, Proposition 3.2 and its proof
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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