论文标题
着色距离图
Coloring the distance graphs
论文作者
论文摘要
令n> 0为一个数字。令GN为n维欧几里得空间上的图形，连接有理距离的点。 GN具有可计数的色数但GN+1却不可行的无选理论ZF+DC是一致的。
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.
