Consistency conjecture for adjacent distance graphs
Statement
Let be a number. Let be the graph on connecting points of rational Euclidean distance. The adjacent distance-graph consistency conjecture. The statement that the chromatic number of is countable while that of is not is consistent with . This concerns the possibility of separating the chromatic behavior of consecutive distance graphs in choiceless set theory; the conjecture is still open for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.