ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥4m\ge4, and let GG be a graph with chromatic number at least mm. An optimal coloring of GG is a coloring using exactly χ(G)\chi(G) colors. The chromatic-critical-pair conjecture. If GG has nonadjacent vertices u,vu,v such that every optimal coloring of GG assigns different colors to uu and vv, then GG contains a 33-connected subgraph with chromatic number at least mm. This conjecture is equivalent to the suspected equality g(2,m)=m+1g(2,m)=m+1 for all m≥4m\ge4, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.