{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:55:45Z","timestamp":1757620545288,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_19","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:12Z","timestamp":1753979112000},"page":"248-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Erd\u0151s-Szekeres Maker-Breaker Games"],"prefix":"10.1007","author":[{"given":"Aleksa","family":"D\u017euklevski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Pokrovskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Valla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lander","family":"Verlinde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105236","volume":"173","author":"O Aichholzer","year":"2020","unstructured":"Aichholzer, O., et al.: A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173, 105236 (2020)","journal-title":"J. Comb. Theory A"},{"issue":"1\u20132","key":"19_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2005.05.007","volume":"343","author":"O Aichholzer","year":"2005","unstructured":"Aichholzer, O., et al.: Games on triangulations. Theoret. Comput. Sci. 343(1\u20132), 42\u201371 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","unstructured":"Aichholzer, O., D\u00edaz-B\u00e1\u00f1ez, J.M., Hackl, T., Mart\u00edn, D.O., Pilz, A., Ventura, I., Vogtenhuber, B.: Erd\u0151s-Szekeres-type games. In: EuroCG, pp. 23:1\u20137 (2019)"},{"issue":"7","key":"19_CR4","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.comgeo.2014.12.007","volume":"48","author":"O Aichholzer","year":"2015","unstructured":"Aichholzer, O., et al.: On $$k$$-gons and $$k$$-holes in point sets. Comput. Geom. 48(7), 528\u2013537 (2015)","journal-title":"Comput. Geom."},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00454-010-9323-7","volume":"47","author":"N Alon","year":"2012","unstructured":"Alon, N.: A non-linear lower bound for planar epsilon-nets. Discr. Comput. Geom. 47(2), 235\u2013244 (2012)","journal-title":"Discr. Comput. Geom."},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106221","volume":"175","author":"SW Bae","year":"2022","unstructured":"Bae, S.W.: Faster counting empty convex polygons in a planar point set. Inf. Process. Lett. 175, 106221 (2022)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/rsa.21088","volume":"62","author":"M Balko","year":"2023","unstructured":"Balko, M., Scheucher, M., Valtr, P.: Tight bounds on the expected number of holes in random point sets. Random Struct. Algorithms 62(1), 29\u201351 (2023)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"19_CR8","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."},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1007\/s00373-014-1488-z","volume":"31","author":"J Cano","year":"2015","unstructured":"Cano, J., Olaverri, A.G., Hurtado, F., Sakai, T., Tejel, J., Urrutia, J.: Blocking the $$k$$-holes of point sets in the plane. Graphs Comb. 31(5), 1271\u20131287 (2015)","journal-title":"Graphs Comb."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1007\/s00454-023-00561-6","volume":"70","author":"D Conlon","year":"2023","unstructured":"Conlon, D., Lim, J.: Fixing a hole. Discr. Comput. Geom. 70, 1551\u20131570 (2023)","journal-title":"Comput. Geom."},{"key":"19_CR11","unstructured":"Czyzowicz, J., Kranakis, E., Urrutia, J.: Guarding the convex subsets of a point-set. In: CCCG. Fredericton, NB (2000)"},{"key":"19_CR12","unstructured":"Das, A.K., Valla, T.: On Erd\u0151s-Szekeres maker-breaker games. In: CCCG (2024). https:\/\/cosc.brocku.ca\/~rnishat\/CCCG_2024_proceedings.pdf"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01840404","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin, D.P., Edelsbrunner, H., Overmars, M.H.: Searching for empty convex polygons. Algorithmica 5(4), 561\u2013571 (1990)","journal-title":"Algorithmica"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/imrn\/rnt041","volume":"2014","author":"P Dodos","year":"2014","unstructured":"Dodos, P., Kanellopoulos, V., Tyros, K.: A simple proof of the density Hales-Jewett theorem. Int. Math. Res. Not. 2014, 3340\u20133352 (2014)","journal-title":"Int. Math. Res. Not."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"D\u017euklevski, A., P\u00e1lv\u00f6lgyi, D., Pokrovskiy, A., T\u00f3th, C.D., Valla, T., Verlinde, L.: Erd\u0151s-Szekeres maker-breaker games. In preparation, available on arXiv (2025)","DOI":"10.1007\/978-981-95-0215-8_19"},{"key":"19_CR16","unstructured":"Erd\u0151s, P.: Some applications of graph theory and combinatorial methods to number theory and geometry. In: Algebraic Methods in Graph Theory, vol I, II (Szeged, 1978), pp. 137\u2013148. North-Holland, Amsterdam (1981)"},{"key":"19_CR17","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF03041066","volume":"57","author":"H Furstenberg","year":"1991","unstructured":"Furstenberg, H., Katznelson, Y.: A density version of the Hales-Jewett theorem. Journal d\u2019Analyse Math\u00e9matique 57, 54\u2013119 (1991)","journal-title":"Journal d\u2019Analyse Math\u00e9matique"},{"issue":"1\u20133","key":"19_CR19","doi-asserted-by":"publisher","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. Discr. Comput. Geom. 39(1\u20133), 239\u2013272 (2008)","journal-title":"Discr. Comput. Geom."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Gowers, W.T.: Polymath and the density Hales-Jewett theorem. In: An Irregular Mind, Bolyai Society Mathematical Studies, vol.\u00a021, pp. 659\u2013687. Springer (2010)","DOI":"10.1007\/978-3-642-14444-8_21"},{"key":"19_CR21","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":"19_CR22","doi-asserted-by":"publisher","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: Positional Games. OS, vol. 44. Springer, Basel (2014). https:\/\/doi.org\/10.1007\/978-3-0348-0825-5_9","DOI":"10.1007\/978-3-0348-0825-5_9"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Heule, M., Scheucher, M.: Happy ending: An empty hexagon in every set of 30 points. In: TACAS. LNCS, vol. 14570, pp. 61\u201380. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-57246-3_5"},{"issue":"12","key":"19_CR24","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.4171\/jems\/1000","volume":"22","author":"AF Holmsen","year":"2020","unstructured":"Holmsen, A.F., Mojarrad, H.N., Pach, J., Tardos, G.: Two extensions of the Erd\u0151s-Szekeres problem. J. Eur. Math. Soc. 22(12), 3981\u20133995 (2020)","journal-title":"J. Eur. Math. Soc."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Horton, J.D.: Sets with no empty convex 7-gons. Canad. Math. Bull. 26 (1983)","DOI":"10.4153\/CMB-1983-077-8"},{"issue":"3","key":"19_CR26","first-page":"73","volume":"15","author":"P Kolipaka","year":"2013","unstructured":"Kolipaka, P., Govindarajan, S.: Two player game variant of the Erd\u0151s-Szekeres problem. Discret. Math. Theor. Comput. Sci. 15(3), 73\u2013100 (2013)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(95)00130-5","volume":"56","author":"J Mitchell","year":"1995","unstructured":"Mitchell, J., Rote, G., Sundaram, G., Woeginger, G.J.: Counting convex polygons in planar point sets. Inf. Process. Lett. 56(1), 45\u201349 (1995)","journal-title":"Inf. Process. Lett."},{"key":"19_CR28","doi-asserted-by":"publisher","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. Disc. Comput. Geom. 38, 389\u2013397 (2007)","journal-title":"Disc. Comput. Geom."},{"issue":"3","key":"19_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.4153\/CMB-2009-048-x","volume":"52","author":"J Pach","year":"2009","unstructured":"Pach, J., Tardos, G., T\u00f3th, G.: Indecomposable coverings. Canad. Math. Bull. 52(3), 451\u2013463 (2009)","journal-title":"Canad. Math. Bull."},{"issue":"3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jcta.2005.03.007","volume":"113","author":"R Pinchasi","year":"2006","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R., Sharir, M.: On empty convex polygons in a planar point set. J. Comb. Theory A 113(3), 385\u2013419 (2006)","journal-title":"J. Comb. Theory A"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.4007\/annals.2012.175.3.6","volume":"175","author":"D Polymath","year":"2012","unstructured":"Polymath, D.: A new proof of the density Hales-Jewett theorem. Ann. Math. 175, 1283\u20131327 (2012)","journal-title":"Ann. Math."},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00373-007-0717-0","volume":"23","author":"T Sakai","year":"2007","unstructured":"Sakai, T., Urrutia, J.: Covering the convex quadrilaterals of point sets. Graphs Combinatorics 23, 343\u2013357 (2007)","journal-title":"Graphs Combinatorics"},{"issue":"4","key":"19_CR33","first-page":"1047","volume":"30","author":"A Suk","year":"2017","unstructured":"Suk, A.: On the Erd\u0151s-Szekeres convex polygon problem. J. AMS 30(4), 1047\u20131053 (2017)","journal-title":"J. AMS"},{"key":"19_CR34","unstructured":"Valla, T.: Ramsey theory and combinatorial games. Master\u2019s thesis, Charles University, Prague (2006)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:34:58Z","timestamp":1757324098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors\u00a0have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}