Weak unit distance conjecture
For a finite point set , consider the pairs of points at Euclidean distance .
Weak unit distance conjecture. For every , there exists a constant such that every finite point set determines at most
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
Primary source
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.