Coloring the distance graphs

2022/01/02 by Zapletal, Jindrich
#03E35 #05C15 #14P99 #FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2201.00275

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.

Related

• Coloring the distance graph in three dimensions
• Coloring Distance Graphs on the Integers
• Coloring distance graphs: a few answers and many questions
• On chromatic numbers of some distance graphs
• Prime and polynomial distances in colourings of the plane