{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:23:45Z","timestamp":1775622225690,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"vor","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":[[2021,2]]},"DOI":"10.1007\/s00493-020-4301-z","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T06:38:19Z","timestamp":1606372699000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Detecting a Long Odd Hole"],"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"}]}],"member":"297","published-online":{"date-parts":[[2020,11,26]]},"reference":[{"key":"4301_CR1","unstructured":"E. BERGER, P. SEYMOUR and S. SPIRKL: Finding an induced path that is not a shortest path, submitted for publication, arXiv:2005.12861."},{"key":"4301_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","volume":"90","author":"D Bienstock","year":"1991","unstructured":"D. BIENSTOCK: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991), 85\u201392.","journal-title":"Discrete Math."},{"key":"4301_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0012-365X(92)90357-L","volume":"102","author":"D Bienstock","year":"1992","unstructured":"D. BIENSTOCK: Corrigendum: On the complexity of testing for odd holes and induced odd paths, Discrete Math. 102 (1992), 109.","journal-title":"Discrete Math."},{"key":"4301_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M Chudnovsky","year":"2005","unstructured":"M. CHUDNOVSKY, G. CORNU\u00c9JOLS, X. LIU, P. SEYMOUR and K. VU\u0160KOVI\u0106: Recognizing Berge graphs, Combinatorica 25 (2005), 143\u2013186.","journal-title":"Combinatorica"},{"key":"4301_CR5","unstructured":"M. CHUDNOVSKY, A. SCOTT and P. SEYMOUR: Finding a shortest odd hole, submitted for publication, arXiv:2004.11874."},{"key":"4301_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375720","volume":"67","author":"M Chudnovsky","year":"2020","unstructured":"M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Detecting an odd hole, J. Assoc. Comput. Mach. 67 (2020), 1\u201312.","journal-title":"J. Assoc. Comput. Mach."},{"key":"4301_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jctb.2019.05.001","volume":"140","author":"M Chudnovsky","year":"2020","unstructured":"M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes, J. Combinatorial Theory, Ser. B 140 (2020), 84\u201397, arXiv:1701.07217.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"4301_CR8","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s11856-020-2034-8","volume":"238","author":"M Chudnovsky","year":"2020","unstructured":"M. CHUDNOVSKY, A. SCOTT, P. SEYMOUR and S. SPIRKL: Proof of the Kalai-Meshulam conjecture, Israel J. Math., 238 (2020), 639\u2013661, arXiv:1810.00065.","journal-title":"Israel J. Math."},{"key":"4301_CR9","unstructured":"L. COOK and P. SEYMOUR: Detecting a long even hole, submitted for publication, arXiv:2009.05691."},{"key":"4301_CR10","doi-asserted-by":"crossref","unstructured":"K. LAI, H. LU and M. THORUP: Three-in-a-tree in near linear time, Proc. 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 1279\u20131292.","DOI":"10.1145\/3357713.3384235"},{"key":"4301_CR11","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":"4301_CR12","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, arXiv:1705.04609.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-020-4301-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T22:45:09Z","timestamp":1669761909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-020-4301-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,26]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["4301"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4301-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,26]]},"assertion":[{"value":"23 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}