Weak pinned distance conjecture
Weak pinned distance conjecture
For a finite point set , a point determines the distinct Euclidean distances from to the other points of .
Weak pinned distance conjecture. For every , there exists a constant such that every finite point set contains a point determining at least
distances to the other points of .
The conjecture is attributed in the source to Erdős. It is presented as an open conjecture and is used to derive a graphical distinct-realisation conjecture.
Sources & referencesView supporting material
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.