{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T01:12:50Z","timestamp":1778202770143,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["NSF Awards DMS-2452737 and DMS-2154129"],"award-info":[{"award-number":["NSF Awards DMS-2452737 and DMS-2154129"]}]},{"DOI":"10.13039\/100005603","name":"Clay Mathematics Institute","doi-asserted-by":"publisher","award":["Clay Research Fellowship"],"award-info":[{"award-number":["Clay Research Fellowship"]}],"id":[{"id":"10.13039\/100005603","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Stanford Science Fellowship"},{"name":"Two Sigma Fellowship"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s11083-025-09722-z","type":"journal-article","created":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:18:58Z","timestamp":1771305538000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Multipartite Analogue of Dilworth\u2019s Theorem"],"prefix":"10.1007","volume":"43","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huy Tuan","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,17]]},"reference":[{"key":"9722_CR1","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.jcta.2004.12.008","volume":"111","author":"N Alon","year":"2005","unstructured":"Alon, N., Pach, J., Pinchasi, R., Radoi\u010di\u0107, R., Sharir, M.: Crossing patterns of semi-algebraic sets. J. Combin. Theory Ser. A 111, 310\u2013326 (2005)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9722_CR2","doi-asserted-by":"crossref","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math. (2) 51, 161\u2013166 (1950)","DOI":"10.2307\/1969503"},{"key":"9722_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Amer. Math. Monthly 68, 1\u201317 (1961)","journal-title":"Amer. Math. Monthly"},{"issue":"1\u20132","key":"9722_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Hajnal, A.: Ramsey-type theorems. Discrete Appl. Math. 25(1\u20132), 37\u201352 (1989)","journal-title":"Discrete Appl. Math."},{"key":"9722_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11083-006-9043-z","volume":"23","author":"J Fox","year":"2006","unstructured":"Fox, J.: A bipartite analogue of Dilworth\u2019s theorem. Order 23, 197\u2013209 (2006)","journal-title":"Order"},{"key":"9722_CR6","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Erd\u0151s-Hajnal-type results on intersection patterns of geometric objects. Horizons of combinatorics, 79\u2013103, Bolyai Soc. Math. Stud., 17, Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-77200-2_4"},{"key":"9722_CR7","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1016\/j.ejc.2008.12.004","volume":"30","author":"J Fox","year":"2009","unstructured":"Fox, J., Pach, J.: A bipartite analogue of Dilworth\u2019s theorem for multiple partial orders. European J. Combin. 30, 1846\u20131853 (2009)","journal-title":"European J. Combin."},{"key":"9722_CR8","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.aim.2012.03.011","volume":"230","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J.: String graphs and incomparability graphs. Adv. Math. 230, 1381\u20131401 (2012)","journal-title":"Adv. Math."},{"key":"9722_CR9","unstructured":"Fox, J., Pach, J., Suk, A.: A structure theorem for pseudo-segments and its applications. preprint, arXiv:2312.01028"},{"key":"9722_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s11856-010-0056-3","volume":"178","author":"J Fox","year":"2010","unstructured":"Fox, J., Pach, J., T\u00f3th, C.D.: Tur\u00e1n-type results for partial orders and intersection graphs of convex sets. Israel J. Math. 178, 29\u201350 (2010)","journal-title":"Israel J. Math."},{"key":"9722_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"MC Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43, 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"9722_CR12","doi-asserted-by":"crossref","unstructured":"K\u00e1rolyi, G., Pach, J., T\u00f3th, G.: Ramsey-type results for geometric graphs, I. Discrete Comput. Geom. 18, 247\u2013255 (1997)","DOI":"10.1007\/PL00009317"},{"issue":"4","key":"9722_CR13","doi-asserted-by":"publisher","first-page":"2532","DOI":"10.1137\/19M125786X","volume":"34","author":"D Kor\u00e1ndi","year":"2020","unstructured":"Kor\u00e1ndi, D., Pach, J., Tomon, I.: Large homogeneous submatrices. SIAM J. Discrete Math. 34(4), 2532\u20132552 (2020)","journal-title":"SIAM J. Discrete Math."},{"key":"9722_CR14","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1017\/S0963548320000103","volume":"29","author":"D Kor\u00e1ndi","year":"2020","unstructured":"Kor\u00e1ndi, D., Tomon, I.: Improved Ramsey-type results for comparability graphs. Combin. Probab. Comput. 29, 747\u2013756 (2020)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"9722_CR15","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.ejc.2011.09.006","volume":"33","author":"J Kyn\u010dl","year":"2012","unstructured":"Kyn\u010dl, J.: Ramsey-type constructions for arrangements of segments. European J. Combin. 33(3), 336\u2013339 (2012)","journal-title":"European J. Combin."},{"key":"9722_CR16","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1112\/blms\/26.2.132","volume":"26","author":"D Larman","year":"1994","unstructured":"Larman, D., Matou\u0161ek, J., Pach, J., T\u00f6r\u0151csik, J.: A Ramsey-type result for convex sets. Bull. London Math. Soc. 26, 132\u2013136 (1994)","journal-title":"Bull. London Math. Soc."},{"key":"9722_CR17","unstructured":"Lee, J.R.: Separators in region intersection graphs. In: 8th Innovations in Theoretical Comp. Sci. Conf. (ITCS 2017), LIPIcs 67, 1\u20138 (2017)"},{"key":"9722_CR18","unstructured":"Lov\u00e1sz, L.: Perfect graphs. In: Selected Topics in Graph Theory, vol. 2. Academic Press, London, 55\u201387 (1983)"},{"key":"9722_CR19","doi-asserted-by":"crossref","unstructured":"Pach, J., Rubin, N., Tardos, G.: Planar point sets determine many pairwise crossing segments. Adv. Math 386(107779), 21 (2021)","DOI":"10.1016\/j.aim.2021.107779"},{"key":"9722_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J Pach","year":"1994","unstructured":"Pach, J., T\u00f6r\u0151csik, J.: Some geometric applications of Dilworth\u2019s theorem. Discrete Comput. Geom. 12, 1\u20137 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"9722_CR21","first-page":"150","volume":"15","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: Comment on Fox News. Geombinatorics 15, 150\u2013154 (2006)","journal-title":"Geombinatorics"},{"key":"9722_CR22","doi-asserted-by":"crossref","unstructured":"Scott, A., Seymour, P., Spirkl, S.: Pure pairs. V. Excluding some long subdivision. Combinatorica 43, 571\u2013593 (2023)","DOI":"10.1007\/s00493-023-00025-8"},{"key":"9722_CR23","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s11083-015-9384-6","volume":"33","author":"I Tomon","year":"2016","unstructured":"Tomon, I.: Tur\u00e1n-type results for complete $$h$$-partite graphs in comparability and incomparability graphs. Order 33, 537\u2013556 (2016)","journal-title":"Order"},{"key":"9722_CR24","doi-asserted-by":"crossref","unstructured":"Tomon, I.: String graphs have the Erd\u0151s-Hajnal property, J. Eur. Math. Soc. (2023), to appear","DOI":"10.4171\/jems\/1362"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-025-09722-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-025-09722-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-025-09722-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T01:07:05Z","timestamp":1778202425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-025-09722-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,17]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["9722"],"URL":"https:\/\/doi.org\/10.1007\/s11083-025-09722-z","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,17]]},"assertion":[{"value":"28 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"13"}}