Ohba's chromatic-choosability conjecture
For a graph , let be its chromatic number, and let be its list chromatic number. A graph is chromatic-choosable when . Ohba's conjecture. Any graph with at most vertices is chromatic-choosable.
References
Status
- Solved: Jonathan A. Noel, Bruce A. Reed, and Hehui Wu. A Proof of a Conjecture of Ohba (Journal of Graph Theory, 2015) https://onlinelibrary.wiley.com/doi/10.1002/jgt.21819
Source: Nandana K Vasudevan, K Somasundaram and N Narayanan, “List-Coloring and Chromatic-Choosability – A Dynamic Survey”, arXiv:2606.31702 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.