Abstract
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least [(13n-6)/36]. The best previous bound, [n/3], from 1952, is due to Leo Moser.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have