Erdős Problem #704 — Let G_n be the unit distance graph in R^n, with two vertices joined by an edge if and only if the distance between them is 1.
Statement
Let be the unit distance graph in , with two vertices joined by an edge if and only if the distance between them is . Estimate the chromatic number . Does it grow exponentially in ? Does exist?
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.