The maximum number of unit distances in a convex n-gon

Beck, 1984, Unit distances, J. Combin. Theory Ser. A, 37, 231, 10.1016/0097-3165(84)90047-5 Danzer, unpublished. H. Edelsbrunner and P. Hajnal, A lower bound on the number of unit distances between the vertices of a convex polygon, J. Combin. Theory Ser. A, in press. Erdős, 1946, On sets of distances of n points, Amer. Math. Monthly, 53, 248, 10.2307/2305092 Erdős, 1986, On some metric and combinatorial geometric problems, Discrete Math., 60, 147, 10.1016/0012-365X(86)90009-9 Erdős, 1989, A problem of Leo Moser about repeated distances on the sphere, Amer. Math. Monthly, 96, 569, 10.2307/2325175 Erdős, 1959, Problem 11, Canadian Math. Bull., 2, 43 P. Erdős and G. Purdy, Some extremal problems in combinatorial geometry, in, “The Handbook of Combinatorics,” to appear. Moser, 1986 Szemerédi, 1983, Extremal problems in discrete geometry, Combinatorica, 3, 381, 10.1007/BF02579194