Chudnovsky–Seymour precolouring-extension conjecture
For every claw-free perfect graph , every clique consisting of simplicial vertices, every integer , every proper precoloring extends to a proper coloring of such that for all and for every , for every list assignment satisfying .
References
- Claw-free perfect graphs are chromatic-choosable — arXiv — Suchismita Mishra, Narayanan Narayanan, Umesh Shankar
Source: arXiv
Progress summary
An unrefereed preprint claims to settle the conjecture, but no independent mathematical assessment was found.
The conjecture asserts that every proper precolouring of a simplicial clique extends from lists of size at least the graph's chromatic number, implying chromatic-choosability for claw-free perfect graphs. A recent survey still describes the corresponding chromatic-choosability conjecture as open.
Unrefereed preprint claim (date not stated)
Suchismita Mishra, Narayanan Narayanan, and Umesh Shankar claim that every proper precolouring of a simplicial clique extends from lists of size at least the chromatic number. If correct, this proves the Chudnovsky–Seymour conjecture and includes all perfect line graphs; the claim is unverified.
Current status (as of November 2026): The conjecture is claimed solved by an unrefereed preprint, but independent verification is absent and the result remains unverified.
Solutions 0
No solutions have been posted yet.