Erdős Problem #1127 — Countably colouring Euclidean space with no repeated distance
Statement
For each , can be partitioned into countably many sets such that within each set every positive distance occurs for at most one unordered pair of points?
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.