A question of Erdős asked whether there exists a set of 𝑛 points such that 𝑐 ⋅ 𝑛 distances occur more than 𝑛 times. We provide an affirmative answer to this question, showing that there exists a set of 𝑛 points such that
P. Brass, W. Moser, and J. Pach. Research problems in discrete geometry. Springer, New York, 2005.
P. Erdős. Some old and new problems in various branches of combinatorics. volume 165/166, pages 227–231. 1997. Graphs and combinatorics (Marseille, 1995).
P. Erdős and J. Pach. Variations on the theme of repeated distances. Combinatorica, 10(3):261–269, 1990.
A. Sheffer. Distinct distances: Open problems and current bounds. [v1] 2014, [v3] 2018.
J. Spencer, E. Szemerédi, and W. Trotter, Jr. Unit distances in the Euclidean plane. In Graph theory and combinatorics (Cambridge, 1983), pages 293–303. Academic Press, London, 1984.