Uniform distances in rational unit-distance graphs (Q686315)

The distance \(\text{dist}(x,y)\) in the graph \(G\) of rational points in the Euclidean space \(E^ d\) is studied; two points are connected by an edge iff their Euclidean distance is one. It is known that \(G\) is connected for \(d \geq 5\). The author shows that, for \(d \geq 8\), \(\text{dist}(x,y)\) cannot exceed the Euclidean distance by more than one.