Unit distance graphs with ambiguous chromatic number (Q2380221)

Summary: First László Székely [\textit{L. Szekely}, ``Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space,'' Combinatorica 4, 213--218 (1984; Zbl 0558.05020)] and more recently Saharon Shelah and Alexander Soifer [\textit{S. Shelah} and \textit{A. Soifer}, ``Axiom of choice and chromatic number of the plane,'' J. Comb. Theory, Ser. A 103, No.\,2, 387--391 (2003; Zbl 1030.03035)] have presented examples of infinite graphs whose chromatic numbers depend on the axioms chosen for set theory. The existence of such graphs may be relevant to the Chromatic Number of the Plane problem. In this paper we construct a new class of graphs with ambiguous chromatic number. They are unit distance graphs with vertex set Rn, and hence may be seen as further evidence that the chromatic number of the plane might depend on set theory.