Woodall's chromatic conjecture for complete bipartite minor-free graphs
Statement
Let be a graph, let be its chromatic number, and write when has no minor.
Woodall's chromatic conjecture. For every , if is a graph with , then
This conjecture is a weakening of Hadwiger's conjecture and was independently proposed by Seymour. The source describes it as open, while noting that Woodall proved the corresponding 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.