Id: palomar/PALOMAR-2026-11-07-000009 Url: https://github.com/jtraverso/thomassen-many-list-colourings/tree/109f88ec9084d00e523bbc7fc558faa86428da52 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000009-v1.json Repo: https://github.com/jtraverso/thomassen-many-list-colourings Tags: math.CO, msc:05C15, msc:05C10, msc:05C30 Score: 0 Title: Thomassen: exponentially many 5-list-colourings of planar graphs Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Formalizes: title=Exponentially many 5-list-colorings of planar graphs identifier=doi:10.1016/j.jctb.2006.09.002 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000009 A Lean 4 / Mathlib formalization of C. Thomassen, Exponentially many 5-list-colorings of planar graphs (J. Combin. Theory Ser. B 97, 2007): a finite planar graph with n vertices, every vertex of which has a list of at least five colours, has at least 2^{n/9} distinct list colourings (two_rpow_card_div_nine_le_ncard_listColourings: (2 : ℝ) ^ (n / 9) ≤ the number of maps f : V → C with f v ∈ L v and f u ≠ f v on every edge). Planarity is combinatorial: a plane map is a rotation system whose hypermap with the dart reversal has Euler defect 0 (definitions copied verbatim from the registered…