Uniform distances in rational unit-distance graphs (Q686315): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:27, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Uniform distances in rational unit-distance graphs |
scientific article |
Statements
Uniform distances in rational unit-distance graphs (English)
0 references
14 October 1993
0 references
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.
0 references
rational unit-distance graphs
0 references
distance
0 references
Euclidean space
0 references
Euclidean distance
0 references