Strong Hadwiger's conjecture
Statement
Let be a graph with chromatic number and let be colorful if every proper -coloring of assigns all colors to vertices in . An -rooted -minor is a model of in such that for every . Strong Hadwiger's conjecture. If is a graph with and is a colorful set in , then contains an -rooted -minor. This strengthens Hadwiger's conjecture by requiring the complete minor to meet a prescribed set that is hard to avoid in every optimal coloring; its status is not resolved in the supplied source.
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.