ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GDG_D be the distance graph on the plane whose vertices are the points of R2\mathbb{R}^2, with two points adjacent when their distance lies in DD. For b>1b>1, write G[1,b]G_{[1,b]} for the graph with distance set [1,b][1,b], and let χ\chi denote chromatic number.

Exoo's conjecture. For b>1b>1 sufficiently close to 11, it holds

χ(G[1,b])=7.\chi(G_{[1,b]})=7.

This conjecture strengthens the known result that χ(G[1,b])=7\chi(G_{[1,b]})=7 for b∈(43/5,7/2]b\in(\sqrt{43}/5,\sqrt{7}/2] and proposes that the same value persists throughout some right neighborhood of 11. The source does not provide evidence of a resolution.

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.