Woodall's list-colouring conjecture for complete bipartite minor-free graphs
Statement
Let be a graph, let denote its list chromatic number, and write when has no minor.
Woodall's list-colouring conjecture. For every , if is a graph with , then
This is a list-colouring strengthening of the corresponding chromatic conjecture for graphs excluding a complete bipartite minor. The source says that both conjectures remain open, although Woodall proved the list-colouring conjecture when .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.