Gerards–Seymour odd Hadwiger conjecture
Statement
Let be a graph. We say that has as an odd minor if there exist vertex-disjoint trees and functions
for which each is a proper -coloring of , and for every there are vertices and with and .
Odd Hadwiger conjecture. If
then has as an odd minor. Equivalently, if does not have as an odd minor, then
Gerards and Seymour proposed this parity-sensitive strengthening of Hadwiger's conjecture. The paper disproves it: for every fixed and all sufficiently large , there is a graph with having no odd minor.
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.