For every positive integer t, every K_{t+1}-topological-minor-free graph and every odd K_{t+1}-minor-free graph admits a vertex coloring with t colors in which every…
Statement
For every positive integer t, every K_{t+1}-topological-minor-free graph and every odd K_{t+1}-minor-free graph admits a vertex coloring with t colors in which every monochromatic component has bounded size.
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.