{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:56:24Z","timestamp":1767034584107},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00373-015-1550-5","type":"journal-article","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T10:38:57Z","timestamp":1425897537000},"page":"335-345","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Empty Triangles in Good Drawings of the Complete Graph"],"prefix":"10.1007","volume":"31","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,10]]},"reference":[{"key":"1550_CR1","unstructured":"Aichholzer, O., Fabila-Monroy, R., Hackl, T., Huemer, C., Pilz, A., Vogtenhuber, B.: Lower bounds for the number of small convex $$k$$ k -holes. In: Proceedings of 24th Canadian Conference on Computational Geometry CCCG\u201912, Charlottetown, Canada, pp. 247\u2013252. (2012)"},{"issue":"2","key":"1550_CR2","first-page":"243","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. Stud. Sci. Math. Hung. 41(2), 243\u2013266 (2004)","journal-title":"Stud. Sci. Math. Hung."},{"key":"1550_CR3","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."},{"key":"1550_CR4","doi-asserted-by":"crossref","unstructured":"Fulek, R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of 29th ACM Symposium on Computational Geometry (SoCG\u201913), Rio de Janeiro, Brazil, pp. 259\u2013265 (2013)","DOI":"10.1145\/2462356.2462394"},{"issue":"1\u20133","key":"1550_CR5","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. Discrete Comput. Geom. 39(1\u20133), 239\u2013272 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"1550_CR6","first-page":"116","volume":"33","author":"H Harborth","year":"1978","unstructured":"Harborth, H.: Konvexe F\u00fcnfecke in ebenen Punktmengen. Elemente der Mathematik 33, 116\u2013118 (1978). In German","journal-title":"Elemente der Mathematik"},{"key":"1550_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(98)00098-3","volume":"191","author":"H Harborth","year":"1998","unstructured":"Harborth, H.: Empty triangles in drawings of the complete graph. Discrete Math. 191, 109\u2013111 (1998)","journal-title":"Discrete Math."},{"issue":"4","key":"1550_CR8","doi-asserted-by":"crossref","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"J Horton","year":"1983","unstructured":"Horton, J.: Sets with no empty convex $$7$$ 7 -gons. Can. Math. Bull. 26(4), 482\u2013484 (1983)","journal-title":"Can. Math. Bull."},{"issue":"3\u20134","key":"1550_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01903339","volume":"51","author":"M Katchalski","year":"1988","unstructured":"Katchalski, M., Meir, A.: On empty triangles determined by points in the plane. Acta Math. Hung. 51(3\u20134), 323\u2013328 (1988)","journal-title":"Acta Math. Hung."},{"issue":"3","key":"1550_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s00454-010-9320-x","volume":"45","author":"J Kyn\u010dl","year":"2011","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom. 45(3), 383\u2013399 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"1550_CR11","doi-asserted-by":"crossref","unstructured":"Lloyd, E.L.: On triangulations of a set of points in the plane. In: 18th Annual Symposium on Foundations of Computer Science, pp. 228\u2013240 (1977)","DOI":"10.1109\/SFCS.1977.21"},{"issue":"2","key":"1550_CR12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00454-007-1343-6","volume":"38","author":"C Nicol\u00e1s","year":"2007","unstructured":"Nicol\u00e1s, C.: The empty hexagon theorem. Discrete Comput. Geom. 38(2), 389\u2013397 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"1550_CR13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/jgt.20249","volume":"56","author":"S Pan","year":"2007","unstructured":"Pan, S., Richter, R.B.: The crossing number of $$K_{11}$$ K 11 is 100. J. Graph Theory 56(2), 128\u2013134 (2007)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1550_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.2307\/2974980","volume":"104","author":"RB Richter","year":"1997","unstructured":"Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Am. Math. Mon. 104(2), 131\u2013137 (1997)","journal-title":"Am. Math. Mon."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1550-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1550-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1550-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:45:17Z","timestamp":1566416717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1550-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1550"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1550-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}