NAEtoColor.Is3Colorable
defimported Lean
A simple graph $G$ on vertex type $V'$ is 3-colorable if there exists a proper coloring $G.\mathtt{Coloring}\;(\mathrm{Fin}\,3)$, i.e.\ a map from vertices to $\{0,1,2\}$ such that no two adjacent vertices share the same color.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in def NAEtoColor.Is3Colorable {V' : Type} (G : SimpleGraph V') : Prop
- Defined in
- TCSlib, `NAEtoColor.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.NAEtoColor.Is3Colorable← NAEtoColor.Is3Colorable (TCSlib/Complexity/NPReductions/NAESATToColoring.lean:136): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 3
- NAEtoColor.NAEtoColorReductionCorrectness of the NAE-SAT to 3-coloring reduction. Let $f$ be a NAE-SAT instance over a variable type $V$, and let $\Gamma(f)$ denote its…
- NAEtoColor.NAEtoColorCompletenessCompleteness of the NAE-SAT to 3-coloring reduction. Let $f$ be a NAE-SAT instance over a variable type $V$, that is, a list of…
- NAEtoColor.NAEtoColorSoundnessSoundness of the NAE-SAT to 3-coloring reduction. Let $f$ be a NAE-SAT instance over a variable type $V$, that is, a list of Not-All-Equal…
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. Equivalently, a valid 3-coloring is equivalent to a graph homomorphism from the given simple graph to the 3-Clique. -/ def NAEtoColor.Is3Colorable {V' : Type} (G : SimpleGraph V') : Prop := Nonempty (G.Coloring (Fin 3))