On almost-equidistant sets - II
Abstract
A set in is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set lying on a -dimensional sphere of radius , where , has at most points. Second, we prove that an almost-equidistant set in has points in two cases: if the diameter of is at most or if is a subset of a -dimensional ball of radius at most , where . Also, we present a new proof of the result of Kupavskii, Mustafa and Swanepoel arXiv:1708.01590 that an almost-equidistant set in has elements.
Cite
@article{arxiv.1708.02039,
title = {On almost-equidistant sets - II},
author = {Alexandr Polyanskii},
journal= {arXiv preprint arXiv:1708.02039},
year = {2019}
}
Comments
8 pages. All proofs are simplified. Open problems are added. Key words: equidistant sets, almost-equidistant sets, unit distance graph, diameter graph, triangle-free graph, Perron-Frobenius Theorem. To appear in the Electronic Journal of Combinatorics