Coloring the distance graphs
Jindřich Zapletal · arXiv (Cornell University) · 2022
Let n>0 be a number. Let Gn be the graph on n-dimensional Euclidean space connecting points of rational distance. It is consistent with the choiceless theory ZF+DC that Gn has countable chromatic number yet Gn+1 does not.