ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph of girth at least five on nn vertices. The graph R6(G)R_6(G) is the reconfiguration graph whose vertices are proper 66-colorings of GG, with edges joining colorings that differ on one vertex.

Six-color conjecture. R6(G)R_6(G) has diameter O(n)O(n).

Planar graphs of girth at least five are colorable from lists of size three, and the paper explains that seven colors already suffice by a simpler argument. The conjectured bound improves this to six colors; no resolution is given in the supplied text.

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.