Nearly equal distances in the plane, II
Combinatorics
2025-10-08 v2 Metric Geometry
Abstract
Let be a separated point set, i.e., any two points have a distance at least . Let be an integer, and be real numbers. Let . Suppose for all that . Then for , the number of pairs , for which , is at most . This is sharp, up to the value of the constant .
Cite
@article{arxiv.2112.08852,
title = {Nearly equal distances in the plane, II},
author = {P. Erdős and E. Makai, and J. Pach},
journal= {arXiv preprint arXiv:2112.08852},
year = {2025}
}
Comments
9 pages