The 3-connected subgraph conjecture for chromatic-critical vertex pairs
Statement
Let , and let be a graph with chromatic number at least . An optimal coloring of is a coloring using exactly colors. The chromatic-critical-pair conjecture. If has nonadjacent vertices such that every optimal coloring of assigns different colors to and , then contains a -connected subgraph with chromatic number at least . This conjecture is equivalent to the suspected equality for all , but the paper leaves it open.
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.