Claw-free perfect graphs are chromatic-choosable

arXiv:2611.01068 · math.CO, cs.DM · Submitted 2026-10-31 · Read on arXiv

math.CO, cs.DM

Submitted: 2026-10-31

Updated: 2026-10-31

Comments: 33 pages, 8 figures

License: http://creativecommons.org/licenses/by/4.0/

The gist: We prove that every claw-free perfect graph G satisfies (G)=χ(G)=ω(G).

Abstract

We prove that every claw-free perfect graph G satisfies (G)=χ(G)=ω(G). More strongly, if S is a clique of simplicial vertices of G and k at leastω(G), every proper precoloring of S extends to a proper coloring of G from arbitrary lists of size k on V(G) S. The proof has three coloring steps: a mixed-list theorem for cobipartite graphs, a precoloring-extension theorem for elementary graphs built on Galvin's kernel method and a homogeneous-pair exchange argument, and a polynomial method (Combinatorial Nullstellensatz) argument for graphs of interval type in which a Vandermonde factor is transferred across each incomplete pair. The three coloring steps are assembled along the structure theorems of Chvátal--Sbihi, Maffray--Reed and Chudnovsky--Seymour, using double clique cutsets for composition. As a consequence, every perfect line graph is chromatic-choosable, recovering the theorem of Peterson and Woodall. Our precoloring extension theorem also resolves a conjecture posed by Chudnovsky and Seymour.

Sources

Related papers