Nivasch, GabrielPach, JánosPinchasi, RomZerbib, Shira2014-07-282014-07-282014-07-28201310.20382/jocg.v4i1a1https://infoscience.epfl.ch/handle/20.500.14299/105327Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). In the present note, we slightly improve on this result to (13/36 + eps)n - O(1) for eps ~= 1/23000. Our main ingredient is an improved bound on the maximum number of isosceles triangles determined by P.text::journal::journal article::research article