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

Problem #670: Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such...

Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at least...

Problem Statement

Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at least $(1+o(1))n^2$?
Categories: Geometry Distances

Progress

The lower bound of $\binom{n}{2}$ for the diameter is trivial. Erdős [Er97f] proved the claim when $d=1$.

Source: erdosproblems.com/670 | Last verified: January 16, 2026

Stay Updated

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