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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-14 Formalized: true Formalizes: title=Elementary graphs are chromatic-choosable identifier=arXiv:2610.16258 relationship=formalizes Formalizes: title=A description of claw-free perfect graphs identifier=doi:10.1006/jctb.1998.1872 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-14-000002 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;…