@article{4056, abstract = {This paper proves that for every n ≥ 4 there is a convex n-gon such that the vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double acute accent}s and Moser if n ≥ 17.}, author = {Edelsbrunner, Herbert and Hajnal, Péter}, issn = {1096-0899}, journal = {Journal of Combinatorial Theory Series A}, number = {2}, pages = {312 -- 316}, publisher = {Elsevier}, title = {{A lower bound on the number of unit distances between the vertices of a convex polygon}}, doi = {10.1016/0097-3165(91)90042-F}, volume = {56}, year = {1991}, }