arXiv · 2103.02757
Coloring the distance graph in three dimensions
Abstract
Let Gn be the graph on n-dimensional Euclidean space connecting points of rational Euclidean distance. It is consistent relative to an inaccessible cardinal that ZF+DC holds and G3 has countable chromatic number, yet G4 has uncountable chromatic number.
Explore related subjects
Keep this discovery
Jindrich Zapletal. 2021-03-03. Coloring the distance graph in three dimensions. https://arxiv.org/abs/2103.02757
Cite the original work for its findings. Save a collection to share your selection of sources.