{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:05:43Z","timestamp":1770966343800,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC Advanced Grant no. 882971 \u201cGeoScape.\""],"award-info":[{"award-number":["ERC Advanced Grant no. 882971 \u201cGeoScape.\""]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00373-025-03006-4","type":"journal-article","created":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T18:57:33Z","timestamp":1765997853000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1118-0321","authenticated-orcid":false,"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,17]]},"reference":[{"key":"3006_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101899","volume":"107","author":"O Aichholzer","year":"2022","unstructured":"Aichholzer, O., Kyn\u010dl, J., Scheucher, M., Vogtenhuber, B., Valtr, P.: On crossing-families in planar point sets. Comput. Geom. 107, 101899 (2022)","journal-title":"Comput. Geom."},{"key":"3006_CR2","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Obenaus, J., Orthaber, J., Paul, R., Schnider, P., Steiner, R., Taubner, T., Vogtenhuber, B.: Edge partitions of complete geometric graphs, In: Proc. 38th International Symposium on Computational Geometry (SoCG 2022), June 7-10, 2022, Berlin, Germany, LIPIcs series, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 224, 6:1\u20136:16, (2022), https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.6","DOI":"10.4230\/LIPIcs.SoCG.2022.6"},{"key":"3006_CR3","unstructured":"Akiyama, J., Kano, M.: Path factors of a graph, In: Graphs and Applications (Boulder, Colorado, 1982), Wiley, New York, (1985), 1\u201321"},{"key":"3006_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comgeo.2004.10.003","volume":"32","author":"G Araujo","year":"2005","unstructured":"Araujo, G., Dumitrescu, A., Hurtado, F., Noy, M., Urrutia, J.: On the chromatic number of some geometric type Kneser graphs. Computational Geometry: Theory & Applications 32, 59\u201369 (2005)","journal-title":"Computational Geometry: Theory & Applications"},{"issue":"2","key":"3006_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01215345","volume":"14","author":"B Aronov","year":"1994","unstructured":"Aronov, B., Erd\u0151s, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14(2), 127\u2013134 (1994)","journal-title":"Combinatorica"},{"issue":"1","key":"3006_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02773612","volume":"154","author":"I B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Prodromou, M.: On maximal convex lattice polygons inscribed in a plane convex set. Israel J. Math. 154(1), 337\u2013360 (2006)","journal-title":"Israel J. Math."},{"issue":"2","key":"3006_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.comgeo.2005.08.006","volume":"34","author":"P Bose","year":"2006","unstructured":"Bose, P., Hurtado, F., Rivera-Campo, E., Wood, D.R.: Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2), 116\u2013125 (2006)","journal-title":"Comput. Geom."},{"key":"3006_CR8","volume-title":"Research Problems in Discrete Geometry","author":"P Bra\u00df","year":"2005","unstructured":"Bra\u00df, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"issue":"3","key":"3006_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"MB Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. Journal of Graph Algorithms and Applications 4(3), 5\u201317 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"3006_CR10","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":"3006_CR11","first-page":"53","volume":"3\u20134","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Szekeres, G.: On some extremum problems in elementary geometry, Annales Universitatis Scientiarium Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio. Mathematica 3\u20134, 53\u201362 (1960)","journal-title":"Mathematica"},{"key":"3006_CR12","unstructured":"Evans, W., Saeedi, N.: On problems related to crossing families, Preprint, (2019), arXiv:1906.00191"},{"key":"3006_CR13","doi-asserted-by":"crossref","unstructured":"Fejes T\u00f3th, L., Fejes T\u00f3th, G., Kuperberg, W.: Lagerungen, Springer Nature Switzerland, (2023).","DOI":"10.1007\/978-3-031-21800-2"},{"key":"3006_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02790016","volume":"34","author":"H Furstenberg","year":"1978","unstructured":"Furstenberg, H., Katznelson, Y.: An ergodic Szemer\u00e9di theorem for commuting transformations. J. Analyse Math. 34, 275\u2013291 (1978)","journal-title":"J. Analyse Math."},{"issue":"3","key":"3006_CR15","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s00454-019-00080-3","volume":"64","author":"I Kov\u00e1cs","year":"2020","unstructured":"Kov\u00e1cs, I., T\u00f3th, G.: Dense point sets with many halving lines. Discrete & Computational Geometry 64(3), 965\u2013984 (2020)","journal-title":"Discrete & Computational Geometry"},{"key":"3006_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"3006_CR17","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2nd edn. Cambridge University Press, Cambridge (2017)","edition":"2"},{"key":"3006_CR18","unstructured":"Ne\u0161et\u0159il, J., Theory, R.: In: Handbook of Combinatorics (R. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz, editors), Vol. II, 1331\u20131403, Elsevier, Amsterdam, (1995)"},{"key":"3006_CR19","unstructured":"Obenaus, J., Orthaber, J.: Edge partitions of complete geometric graphs (part\u00a01), Preprint, (2021), arXiv:2108.05159"},{"key":"3006_CR20","doi-asserted-by":"crossref","unstructured":"Pach, J., Rubin, N., Tardos, G.: Planar point sets determine many pairwise crossing segments, Proc. 51st Annual ACM SIGACT Symposium on Theory of Computing, pp.\u00a01158\u20131166 (2019)","DOI":"10.1145\/3313276.3316328"},{"key":"3006_CR21","doi-asserted-by":"crossref","unstructured":"Pach, J., Saghafian, M., Schnider, P.: Decomposition of geometric graphs into star forests, Proc. 31th International Symposium on Graph Drawing and Network Visualization (GD 2023), vol. 14465 of LNCS, pp.\u00a0339\u2013346. Preprint, (2023), arXiv:2306.13201","DOI":"10.1007\/978-3-031-49272-3_23"},{"key":"3006_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1090\/conm\/223\/03141","volume":"223","author":"J Pach","year":"1999","unstructured":"Pach, J., Solymosi, J.: Halving lines and perfect cross-matchings. Contemp. Math. 223, 245\u2013250 (1999)","journal-title":"Contemp. Math."},{"key":"3006_CR23","doi-asserted-by":"crossref","unstructured":"Polymath, D.H.J.: A new proof of the density Hales-Jewett theorem, Annals of Mathematics, 1283\u20131327, (2012)","DOI":"10.4007\/annals.2012.175.3.6"},{"key":"3006_CR24","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1090\/jams\/869","volume":"30","author":"A Suk","year":"2017","unstructured":"Suk, A.: On the Erd\u0151s-Szekeres convex polygon problem. J. Am. Math. Soc. 30, 1047\u20131053 (2017)","journal-title":"J. Am. Math. Soc."},{"key":"3006_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E Szemer\u00e9di","year":"1975","unstructured":"Szemer\u00e9di, E.: On sets of integers containing no $$k$$ elements in arithmetic progression. Acta Arith 27, 199\u2013245 (1975)","journal-title":"Acta Arith"},{"issue":"2","key":"3006_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02187831","volume":"7","author":"P Valtr","year":"1992","unstructured":"Valtr, P.: Convex independent sets and 7-holes in restricted planar point sets. Discrete & Computational Geometry 7(2), 135\u2013152 (1992)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"3006_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01844852","volume":"16","author":"P Valtr","year":"1996","unstructured":"Valtr, P.: Lines, line-point incidences and crossing families in dense sets. Combinatorica 16(2), 269\u2013294 (1996)","journal-title":"Combinatorica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-03006-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:05:12Z","timestamp":1770962712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-03006-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,17]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3006"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-03006-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,17]]},"assertion":[{"value":"12 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"9"}}