@article{8953a2213d444d5c88830d90fb89469d,
title = "Detecting a Long Odd Hole",
abstract = "For each integer ℓ ≥ 5, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and odd.",
author = "Maria Chudnovsky and Alex Scott and Paul Seymour",
note = "Funding Information: This material is based upon work supported in part by the U. S. Army Research Office under grant number W911NF-16-1-0404, and by NSF grant DMS-1763817. Funding Information: Supported by a Leverhulme Trust Research Fellowship. Funding Information: Supported by NSF grant DMS-1800053 and AFOSR grant A9550-19-1-0187, and partially supported by the Simons Foundation and by the Mathematisches Forschungsinstitut Oberwolfach. Acknowledgement Publisher Copyright: {\textcopyright} 2021, J{\'a}nos Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.",
year = "2021",
month = feb,
doi = "10.1007/s00493-020-4301-z",
language = "English (US)",
volume = "41",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",
}