{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:40:55Z","timestamp":1778496055326,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00493-020-4024-1","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T18:13:02Z","timestamp":1625681582000},"page":"379-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Pure Pairs. II. Excluding All Subdivisions of A Graph"],"prefix":"10.1007","volume":"41","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Spirkl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"4024_CR1","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.jcta.2004.12.008","volume":"111","author":"N Alon","year":"2005","unstructured":"N. Alon, J. Pach, R. Pinchasi, R. Radoi\u010di\u0107 and M. Sharir: Crossing patterns of semi-algebraic sets, J. Combinatorial Theory, Ser. A 111 (2005), 310\u2013326.","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"4024_CR2","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/140981745","volume":"30","author":"M Bonamy","year":"2016","unstructured":"M. Bonamy, N. Bousquet and S. Thomass\u00e9: The Erd\u0151s-Hajnal conjecture for long holes and antiholes, SIAM J. Discrete Math 30 (2016), 1159\u20131164.","journal-title":"SIAM J. Discrete Math"},{"key":"4024_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.jctb.2015.01.001","volume":"113","author":"N Bousquet","year":"2015","unstructured":"N. Bousquet, A. Lagoutte and S. Thomass\u00e9: The Erd\u0151s-Hajnal conjecture for paths and antipaths, J. Combinatorial Theory, Ser. B 113 (2015), 261\u2013264.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4024_CR4","doi-asserted-by":"crossref","unstructured":"K. Choromanski, D. Falik, A. Liebenau, V. Patel and M. Pilipczuk: Excluding hooks and their complements, Electronic Journal of Combinatorics 25 #P3.27, 2018.","DOI":"10.37236\/6397"},{"key":"4024_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/jgt.21730","volume":"75","author":"M Chudnovsky","year":"2014","unstructured":"M. Chudnovsky: The Erd\u0151s-Hajnal conjecture a survey, J. Graph Theory 75 (2014), 178\u2013190.","journal-title":"J. Graph Theory"},{"key":"4024_CR6","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s00493-016-3467-x","volume":"37","author":"M Chudnovsky","year":"2017","unstructured":"M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. III. Long holes, Combinatorica 37 (2017), 1057\u201372.","journal-title":"Combinatorica"},{"key":"4024_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ejc.2018.09.003","volume":"76","author":"M Chudnovsky","year":"2019","unstructured":"M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. XI. Orientations, European Journal of Combinatorics 76 (2019), 53\u201361, arXiv:1711.07679.","journal-title":"European Journal of Combinatorics"},{"key":"4024_CR8","doi-asserted-by":"publisher","first-page":"107396","DOI":"10.1016\/j.aim.2020.107396","volume":"375","author":"M Chudnovsky","year":"2020","unstructured":"M. Chudnovsky, A. Scott, P. Seymour and S. Spirkl: Pure pairs. I. Trees and linear anticomplete pairs, Advances in Math 375 (2020), 107396.","journal-title":"Advances in Math"},{"key":"4024_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00493-014-3000-z","volume":"35","author":"M Chudnovsky","year":"2015","unstructured":"M. Chudnovsky and P. Seymour: Excluding paths and antipaths, Combinatorica 35 (2015), 389\u2013412.","journal-title":"Combinatorica"},{"key":"4024_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/jgt.20626","volume":"70","author":"M Chudnovsky","year":"2012","unstructured":"M. Chudnovsky and Y. Zwols: Large cliques or stable sets in graphs with no fouredge path and no five-edge path in the complement, J. Graph Theory 70 (2012), 449\u2013472.","journal-title":"J. Graph Theory"},{"key":"4024_CR11","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u0151s","year":"1947","unstructured":"P. Erd\u0151s: Some remarks on the theory of graphs, Bull. Amer. Math. Soc 53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc"},{"key":"4024_CR12","volume-title":"Graphentheorie und Ihre Anwendungen","author":"P Erd\u0151s","year":"1977","unstructured":"P. Erd\u0151s and A. Hajnal: On spanned subgraphs of graphs, Graphentheorie und Ihre Anwendungen (Oberhof, 1977), https:\/\/www.renyi.hu\/~p_erdos\/1977-19.pdf"},{"key":"4024_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P Erd\u0151s","year":"1989","unstructured":"P. Erd\u0151s and A. Hajnal: Ramsey-type theorems, Discrete Applied Mathematics 25 (1989), 37\u201352.","journal-title":"Discrete Applied Mathematics"},{"key":"4024_CR14","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463\u2013470.","journal-title":"Compositio Mathematica"},{"key":"4024_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11083-006-9043-z","volume":"23","author":"J Fox","year":"2006","unstructured":"J. Fox: A bipartite analogue of Dilworth's theorem, Order 23 (2006), 197\u2013209.","journal-title":"Order"},{"key":"4024_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-77200-2_4","volume-title":"Horizon of Combinatorics","author":"J Fox","year":"2008","unstructured":"J. Fox and J. Pach: Erd\u0151s-Hajnal-type results on intersection patterns of geometric objects, in: Horizon of Combinatorics (G. O. H. Katona et al., eds.), Bolyai Society Studies in Mathematics, Springer, 79\u2013103, 2008."},{"key":"4024_CR17","first-page":"10","volume-title":"Infinite and Finite Sets","author":"A Gy\u00e9rf\u00e9s","year":"1975","unstructured":"A. Gy\u00e9rf\u00e9s: On Ramsey covering-numbers, Coll. Math. Soc. J\u00e9nos Bolyai, in: Infinite and Finite Sets, North Holland\/American Elsevier, New York (1975), 10."},{"key":"4024_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jctb.2018.09.002","volume":"136","author":"A Liebenau","year":"2019","unstructured":"A. Liebenau, M. Pilipczuk, P. Seymour and S. Spirkl: Caterpillars in Erd\u0151sHajnal, J. Combinatorial Theory, Ser. B 136 (2019), 33\u201343, arXiv:1810.00811.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4024_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.jctb.2013.11.001","volume":"105","author":"A Pawlik","year":"2014","unstructured":"A. Pawlik, J. Kozik, T. Krawczyk, M. Laso\u0144, P. Micek, W. T. Trotter and B. Walczak: Triangle-free intersection graphs of line segments with large chromatic number, J. Combinatorial Theory, Ser. B 105 (2014), 6\u201310.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4024_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(86)90076-2","volume":"59","author":"V R\u00f6dl","year":"1986","unstructured":"V. R\u00f6dl: On universality of graphs with uniformly distributed edges, Discrete Math 59 (1986), 125\u2013134.","journal-title":"Discrete Math"},{"key":"4024_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jctb.2015.10.002","volume":"121","author":"A Scott","year":"2016","unstructured":"A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. I. Odd holes, J. Combinatorial Theory, Ser. B 121 (2016), 68\u201384.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4024_CR22","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jctb.2018.03.006","volume":"132","author":"A Scott","year":"2018","unstructured":"A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes, J. Combinatorial Theory, Ser. B 132 (2018), 180\u2013235, arXiv:1509.06563.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4024_CR23","doi-asserted-by":"crossref","unstructured":"A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths, Electronic J. Combinatorics 24 #P2.53, 2017.","DOI":"10.37236\/6768"},{"key":"4024_CR24","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00493-019-3804-y","volume":"39","author":"A Scott","year":"2019","unstructured":"A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. X. Holes with specific residue, Combinatorica 39 (2019), 1105\u20131132","journal-title":"Combinatorica"},{"key":"4024_CR25","first-page":"557","volume-title":"The Theory and Applications of Graphs","author":"D P Sumner","year":"1981","unstructured":"D. P. Sumner: Subtrees of a graph and chromatic number, in: The Theory and Applications of Graphs, (G. Chartrand, ed.), John Wiley & Sons, New York (1981), 557\u2013576."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4024-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4024-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4024-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T18:42:15Z","timestamp":1625683335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4024-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["4024"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4024-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]},"assertion":[{"value":"9 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}