{"id":"palomar/PALOMAR-2026-11-20-000011","url":"https://github.com/Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization/tree/5827daedcf71c0f9992a29fda7ecb4c588d3a6b2","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000011-v1.json","repo":"https://github.com/Harry-Tech-Guide/Lean-4-Four-Color-Theorem-Formalization","tags":["math.CO","cs.LO","msc:05C15","msc:05C10","msc:68V15"],"score":0,"title":"The Combinatorial Four Color Theorem in Lean 4","trust":"high","domain":"math.CO","source":"palomar","authors":["Harry Wang"],"reviews":0,"subject":"math.CO","summary":"A self-contained, zero-Mathlib Lean 4 formalization of the Combinatorial Four Color Theorem: every finite, complete, Euler-planar, bridgeless orientable combinatorial map (involutive hypermap, `e^2 = id`, `e ∘ n ∘ f = id`) admits a proper 4-coloring of its faces (`Solution.four_color_theorem`). Follows the published mathematics of Robertson, Sanders, Seymour, and Thomas (1996/1997) and Gonthier's hypermap framework (2008), verifying all 633 unavoidable configurations (249 D-reducible and 384 C-reducible) and all 5 cartwheel discharging trees directly inside the Lean kernel without…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-20","reactions":{},"formalized":true,"formalizes":[{"title":"The four-colour theorem","identifier":"doi:10.1006/jctb.1997.1750","relationship":"formalizes"},{"title":"A new proof of the four-colour theorem","identifier":"doi:10.1090/S1079-6762-96-00003-0","relationship":"formalizes"},{"title":"Formal proof — the four-color theorem","identifier":"","relationship":"adapts"}]}