← All problems

Weak unit distance conjecture

1 year old · traced to

For a finite point set P⊆R2P\subseteq\mathbb R^2, consider the pairs of points at Euclidean distance 11.

Weak unit distance conjecture. For every ε>0\varepsilon>0, there exists a constant Cε>0C_\varepsilon>0 such that every finite point set P⊆R2P\subseteq\mathbb R^2 determines at most

Cε∣P∣1+εC_\varepsilon |P|^{1+\varepsilon}

unit distances.

The source attributes this conjecture to Erdős and records a best known bound due to Spencer, Szemerédi and Trotter. Its resolution status is not supplied.

References
  1. Sean Dewar, Nora Frankl, Samuel Mansfield, Anthony Nixon, Jonathan Passant and Audie Warren, “Generalised Erdős distance theory on graphs”, arXiv:2505.06590 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.