{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T05:20:29Z","timestamp":1710998429558},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0097-3165(91)90042-f","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"312-316","source":"Crossref","is-referenced-by-count":22,"title":["A lower bound on the number of unit distances between the vertices of a convex polygon"],"prefix":"10.1016","volume":"56","author":[{"given":"Herbert","family":"Edelsbrunner","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"Hajnal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(91)90042-F_BIB1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","article-title":"On sets of distances of n points","volume":"53","author":"Erd\u0151s","year":"1946","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0097-3165(91)90042-F_BIB2","series-title":"Geometry and Combinatorial Geometry, Proc. Conf. Univ. Haifa","first-page":"46","article-title":"Some combinatorial problems in geometry","volume":"Vol. 792","author":"Erd\u00f6s","year":"1980"},{"key":"10.1016\/0097-3165(91)90042-F_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1017\/S0008439500024863","article-title":"Problem 11","volume":"2","author":"Erd\u00f6s","year":"1959","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0097-3165(91)90042-F_BIB4","series-title":"The maximum number of unit distances in a convex n-gon","author":"F\u00fcredi","year":"1987"},{"key":"10.1016\/0097-3165(91)90042-F_BIB5","series-title":"100 research problems in discrete geometry","author":"Moser","year":"1986"},{"key":"10.1016\/0097-3165(91)90042-F_BIB6","series-title":"Graph Theory and Combinatorics, Proc. Cambridge Conf. Combinatorics","first-page":"293","article-title":"Unit distances in the Euclidean plane","author":"Spencer","year":"1984"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190042F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190042F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T18:29:48Z","timestamp":1586111388000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731659190042F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["009731659190042F"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(91)90042-f","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}