{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:40:20Z","timestamp":1762033220618},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T00:00:00Z","timestamp":1407196800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00493-014-3000-z","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T05:02:40Z","timestamp":1407214960000},"page":"389-412","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Excluding paths and antipaths"],"prefix":"10.1007","volume":"35","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,5]]},"reference":[{"key":"3000_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s004930100016","volume":"21","author":"N. Alon","year":"2001","unstructured":"N. Alon, J. Pach, and J. Solymosi: Ramsey-type theorems with forbidden subgraphs, Combinatorica 21 (2001), 155\u2013170.","journal-title":"Combinatorica"},{"key":"3000_CR2","unstructured":"N. Bousquet, A. Lagoutte and S. Thomass\u00e9: The Erd\u0151s-Hajnal conjecture for paths and antipaths, submitted for publication."},{"key":"3000_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas: The strong perfect graph theorem, Annals of Math 164 (2006), 51\u2013229.","journal-title":"Annals of Math"},{"key":"3000_CR4","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1016\/j.jctb.2008.02.005","volume":"98","author":"M. Chudnovsky","year":"2008","unstructured":"M. Chudnovsky and S. Safra: The Erd\u0151s-Hajnal conjecture for bull-free graphs, J. Combin. Theory, Ser. B 98 (2008), 1301\u20131310.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"3000_CR5","unstructured":"M. Chudnovsky and Y. Zwols: Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement, to appear in J. Graph Theory."},{"key":"3000_CR6","doi-asserted-by":"crossref","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":"3000_CR7","doi-asserted-by":"crossref","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":"3000_CR8","unstructured":"J. Fox: private communication."},{"key":"3000_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-642-60406-5_10","volume":"13\u201314","author":"A. Gy\u00e1rf\u00e1s","year":"1997","unstructured":"A. Gy\u00e1rf\u00e1s: Reflection on a problem of Erd\u0151s and Hajnal, in: Mathematics of Paul Erd\u0151s, R. L. Graham, J. Neset\u0159il, editors, Algorithms and Combinatorics, Volumes 13\u201314, Springer 1997 (vol. 14), 93\u201398.","journal-title":"Mathematics of Paul Erd\u0151s"},{"key":"3000_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz: Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics 2 (1972), 253\u2013267.","journal-title":"Discrete Mathematics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3000-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3000-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3000-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:50Z","timestamp":1559093570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3000-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,5]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["3000"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3000-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,5]]}}}