{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-07","reactions":{},"formalized":true,"formalizes":[{"title":"Exponentially many 5-list-colorings of planar graphs","identifier":"doi:10.1016/j.jctb.2006.09.002","relationship":"formalizes"}]}