距离图的着色
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。