| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415880 | Computational Geometry | 2006 | 9 Pages |
Abstract
A point set is separated if the minimum distance between its elements is one. Two numbers are called nearly equal if they differ by at most one. If a fixed positive percentage of all pairs of points belonging to a separated set of size n in R3 determine nearly equal distances, then the diameter of the set is at least constant times n. This proves a conjecture of Erdős.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
