{"month":"03","date_created":"2018-12-11T12:06:41Z","citation":{"short":"H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.","ama":"Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. 1991;56(2):312-316. doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>","mla":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:<a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">10.1016/0097-3165(91)90042-F</a>.","ieee":"H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” <i>Journal of Combinatorial Theory Series A</i>, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.","ista":"Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.","chicago":"Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1991. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>.","apa":"Edelsbrunner, H., &#38; Hajnal, P. (1991). A lower bound on the number of unit distances between the vertices of a convex polygon. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(91)90042-F\">https://doi.org/10.1016/0097-3165(91)90042-F</a>"},"acknowledgement":"The first author is pleased to acknowledge partial support by the Amoco Fnd. Fat. Dev. Comput. Sci. i-6-44862 and the National Science Foundation under Grant CCR-8714565.","article_processing_charge":"No","oa":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","page":"312 - 316","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"extern":"1","type":"journal_article","date_updated":"2022-03-02T09:56:10Z","volume":56,"abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","publication":"Journal of Combinatorial Theory Series A","_id":"4056","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hajnal","first_name":"Péter","full_name":"Hajnal, Péter"}],"doi":"10.1016/0097-3165(91)90042-F","date_published":"1991-03-01T00:00:00Z","day":"01","article_type":"original","year":"1991","publisher":"Elsevier","language":[{"iso":"eng"}],"intvolume":"        56","publist_id":"2070","oa_version":"Published Version","issue":"2","quality_controlled":"1","scopus_import":"1","title":"A lower bound on the number of unit distances between the vertices of a convex polygon","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/009731659190042F?via%3Dihub"}]}