2000 character limit reached
Coloring the distance graphs (2201.00275v1)
Published 2 Jan 2022 in math.LO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.