ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1 be a number. Let Δn\Delta_n be the graph on Rn\mathbb{R}^n connecting points of rational Euclidean distance. The adjacent distance-graph consistency conjecture. The statement that the chromatic number of Δn\Delta_n is countable while that of Δn+1\Delta_{n+1} is not is consistent with ZF+DC\mathrm{ZF}+\mathrm{DC}. This concerns the possibility of separating the chromatic behavior of consecutive distance graphs in choiceless set theory; the conjecture is still open for n=4n=4 and higher.

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.