{"id":"palomar/PALOMAR-2026-11-14-000002","url":"https://github.com/jtraverso/elementary-graphs-choosable/tree/01fb4e5b5cecc9d86b577a1c6cc2c05eac6c3245","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000002-v1.json","repo":"https://github.com/jtraverso/elementary-graphs-choosable","tags":["math.CO","msc:05C15","msc:05C17"],"score":0,"title":"Elementary graphs are chromatic-choosable","trust":"high","domain":"math.CO","source":"palomar","authors":["Juan Pablo Traverso Gianini"],"reviews":0,"subject":"math.CO","summary":"A Lean 4 / Mathlib formalization of the theorem of Narayanan, Vasudevan and Somasundaram (arXiv:2610.16258) that every finite elementary graph satisfies ch(G) = χ(G) = ω(G) (chromaticChoosable_of_isElementary; clique number at most k implies k-choosability for every colour type, choosable_of_isElementary), together with the structure theorem of Maffray and Reed (JCTB 75, 1999, Theorem 2, (i) ⇒ (iii)) that the proof starts from: every finite elementary graph is an augmentation of the line graph of a bipartite multigraph, given by an explicit edge representation (rep_of_isElementary;…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"Elementary graphs are chromatic-choosable","identifier":"arXiv:2610.16258","relationship":"formalizes"},{"title":"A description of claw-free perfect graphs","identifier":"doi:10.1006/jctb.1998.1872","relationship":"formalizes"}]}