Elementary graphs are chromatic-choosable
Source: github.com/jtraverso/elementary-graphs-choosable/tree/01fb4…
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;…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-14-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'