The Erdős-Pósa property for odd cycles in highly connected graphs (Q5955201)

An \(f(k)\)-connected graph either contains \(k\) vertex-disjoint odd cycles or an odd cycle cover containing at most \(2k-2\) vertices. This result was proved by \textit{C. Thomassen} [Combinatorica 21, 321-333 (2001)] with a doubly exponential \(f(k)\). The authors prove it with \(f(k)=576k\) and show that this is ``essentially best possible''.