Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\) (Q756706)

The authors prove that if the continuum hypothesis holds, then \({\mathbb{R}}^2\) can be decomposed into countably many pieces, none spanning a right-angled triangle. They also obtain some partial results concerning the conjecture that the given result is also true when `right- angled' is replaced by `isosceles'. Finally, they show that \({\mathbb{R}}^3\) can be coloured with countably many colours with no monochromatic rational distance.