Bounding the size of an almost-equidistant set in Euclidean space
Kupavskii, A., Mustafa, N. H. & Swanepoel, K.
(2019).
Bounding the size of an almost-equidistant set in Euclidean space.
Combinatorics, Probability and Computing,
28(2), 280-286.
https://doi.org/10.1017/S0963548318000287
(2019).
Bounding the size of an almost-equidistant set in Euclidean space.
Combinatorics, Probability and Computing,
28(2), 280-286.
https://doi.org/10.1017/S0963548318000287
A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in Rd has cardinality O(d4/3).