SATtoColor.Is3Colorable
defimported Lean
A simple graph $G$ on vertex type $V'$ is 3-colorable if there exists a proper graph coloring with colors $\mathrm{Fin}\,3$, i.e.\ $\mathrm{Nonempty}(G.\mathrm{Coloring}(\mathrm{Fin}\,3))$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in def SATtoColor.Is3Colorable {V' : Type} (G : SimpleGraph V') : Prop
- Defined in
- TCSlib, `SATtoColor.Is3Colorable`
- Lean proof
- By CS 294-268 course staff (UC Berkeley, Spring 2026), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 UC Berkeley CS 294. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.SATtoColor.Is3Colorable← SATtoColor.Is3Colorable (TCSlib/Complexity/NPReductions/ThreeSATToColoring.lean:128): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 3
- SATtoColor.SATtoColorReductionCorrectness of the 3-SAT to 3-coloring reduction. Let $f$ be a 3-SAT instance over a variable type $V$: a list of clauses, each clause an…
- SATtoColor.SATtoColorSoundnessSoundness of the 3-SAT to 3-colouring reduction. Let $f$ be a 3-SAT instance over a variable type $V$, that is, a list of clauses, each…
- SATtoColor.SATtoColorCompletenessCompleteness of the 3-SAT to 3-coloring reduction. Let $f$ be a 3-SAT instance over a variable type $V$, that is, a list of clauses, each…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- A simple graph is 3-colorable if there exists a valid 3-coloring. -/ def SATtoColor.Is3Colorable {V' : Type} (G : SimpleGraph V') : Prop := Nonempty (G.Coloring (Fin 3))