← All problems

Ohba's chromatic-choosability conjecture

Less than 1 year old · traced to

For a graph GG, let χ(G)\chi(G) be its chromatic number, and let χℓ(G)\chi_\ell(G) be its list chromatic number. A graph is chromatic-choosable when χℓ(G)=χ(G)\chi_\ell(G)=\chi(G). Ohba's conjecture. Any graph GG with at most 2χ(G)+12\chi(G)+1 vertices is chromatic-choosable.

References

Status

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.