Coloring the distance graphs
Logic
2022-01-04 v1
Abstract
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.
Cite
@article{arxiv.2201.00275,
title = {Coloring the distance graphs},
author = {Jindrich Zapletal},
journal= {arXiv preprint arXiv:2201.00275},
year = {2022}
}