Chudnovsky, MariaScott, AlexSeymour, PaulSpirkl, Sophie2022-08-122022-08-122020-01https://doi.org/10.1016/j.jctb.2019.05.001http://hdl.handle.net/10012/18528The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2019.05.001 © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We prove a conjecture of András Gyárfás, that for all k, l, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalinduced subgraphsodd holesArticle