Axiom of choice and chromatic number of the plane (Q1406751)

Let \(U^2\) be the graph with underlying set \(\mathbb{R}^2\) and with two points adjacent iff their distance is one. It is an old problem to determine the chromatic number of \(U^2\). So far it is known that it can be 4, 5, 6 or 7. Further on it is known that it is at least 5 if monochromatic sets are Lebesgue measurable. The authors investigate the following example: Let \(G\) be the graph with underlying set \(\mathbb{R}\) and the set of edges \(\{(s,t): s- t-\sqrt{2}\in \mathbb{Q}\}\). They show that in ZFC the chromatic number of \(U\) is equal to 2. But assuming the countable axiom of choice and that every set of reals is Lebesgue measurable, the chromatic number of \(U\) cannot be equal to any positive integer \(n\) nor even to \(\aleph_0\).