Abstract
We show the following for every sufficiently connected graph , any vertex subset of , and given integer : there are disjoint odd cycles in each containing a vertex of or there is set of at most vertices such that does not contain any odd cycle that contains a vertex of . We prove this via an extension of Kawarabayashi and Reed's result about parity--linked graphs (Combinatorica 29, 215-225). From this result it is easy to deduce several other well known results about the Erdős-Pósa property of odd cycles in highly connected graphs. This strengthens results due to Thomassen (Combinatorica 21, 321-333), and Rautenbach and Reed (Combinatorica 21, 267-278), respectively.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.