Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #100

Problem #100: Let $A$ be a set of $n$ points in $\mathbb{R}^2$ such that...

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...

Problem Statement

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$?
Categories: Geometry Distances

Progress

Perhaps the diameter is even $\geq n-1$ for sufficiently large $n$. Piepmeyer has an example of $9$ such points with diameter $<5$. Kanold proved the diameter is $\geq n^{3/4}$. The bounds on the distinct distance problem [89] proved by Guth and Katz [GuKa15] imply a lower bound of $\gg n/\log n$.

Source: erdosproblems.com/100 | Last verified: January 13, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.