{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:21:57Z","timestamp":1648898517680},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T00:00:00Z","timestamp":1348790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1220-9","type":"journal-article","created":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T13:44:12Z","timestamp":1348753452000},"page":"1623-1631","source":"Crossref","is-referenced-by-count":2,"title":["On the Number of Edges in Geometric Graphs Without Empty Triangles"],"prefix":"10.1007","volume":"29","author":[{"given":"C.","family":"Bautista-Santiago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Heredia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Huemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ram\u00edrez-Vigueras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Seara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,28]]},"reference":[{"issue":"2","key":"1220_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1556\/SScMath.41.2004.2.4","volume":"41","author":"I. B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny I., Valtr P.: Planar point sets with a small number of empty convex polygons. Studia Scientiarum Mathematicarum Hungarica 41(2), 243\u2013266 (2004)","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"1220_CR2","first-page":"52","volume":"5","author":"P. Erd\u0151s","year":"1978","unstructured":"Erd\u0151s P.: Some more problems on elementary geometry. Aust. Math. Soc. Gaz. 5, 52\u201354 (1978)","journal-title":"Aust. Math. Soc. Gaz."},{"issue":"1-3","key":"1220_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s00454-007-9018-x","volume":"39","author":"T. Gerken","year":"2008","unstructured":"Gerken T.: Empty convex hexagons in planar point sets. Discret. Comput. Geom. 39(1-3), 239\u2013272 (2008)","journal-title":"Discret. Comput. Geom."},{"key":"1220_CR4","first-page":"116","volume":"33","author":"H. Harborth","year":"1978","unstructured":"Harborth H.: Konvexe F\u00fcnfecke in ebenen Punktmengen. Elem. Math. 33, 116\u2013118 (1978)","journal-title":"Elem. Math."},{"key":"1220_CR5","doi-asserted-by":"crossref","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"J.D. Horton","year":"1983","unstructured":"Horton J.D.: Sets with no empty convex 7-gons. Can. Math. Bull. 26, 482\u2013484 (1983)","journal-title":"Can. Math. Bull."},{"key":"1220_CR6","doi-asserted-by":"crossref","unstructured":"Nara, C., Sakai, T., Urrutia, J.: Maximal number of edges in geometric graphs without convex polygons. In: Akiyama, J., Kano, M. (eds.) Discrete and Computational Geometry. Lecture Notes in Computer Science. vol. 2866, pp. 215\u2013220. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-44400-8_23"},{"key":"1220_CR7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00454-007-1343-6","volume":"38","author":"C.M. Nicol\u00e1s","year":"2007","unstructured":"Nicol\u00e1s C.M.: The empty hexagon theorem. Discret. Comput. Geom. 38, 389\u2013397 (2007)","journal-title":"Discret. Comput. Geom."},{"key":"1220_CR8","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1220-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1220-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1220-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:34Z","timestamp":1559041174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1220-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,28]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1220"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1220-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,28]]}}}