Erdős Problem #100

declared status 'open'. Formalized: yes. Let $A$ be a set of $n$ points in $\mathbb{R}^2$ such that all pairwise distances are at least $1$ and if two distinct distances differ then they differ by at least $1$. Is the diameter of $A$ $\gg n$? Current best: The bounds on the distinct distance problem [89] proved by Guth and Katz [GuKa15] imply a lower bound of $\gg n/\log n$. Prize: no. Tags: distances, geometry.

Notation is rendered from the stored source. The pinned checkout remains the exact record.