Erdős Problem #1127 — Countably colouring Euclidean space with no repeated distance
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?
References
Primary source
P. Erdős, Some remarks on subgroups of real numbers, Colloquium Mathematicum 42 (1979), 119–120.
Additional references
P. Erdős, Some remarks on subgroups of real numbers, Colloquium Mathematicum 42 (1979), 119–120.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.