The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity

Dedicated to the memory of Paul Erdős

A graph G is k-linked if G has at least 2k vertices, and, for any vertices , , ..., , , , ..., , G contains k pairwise disjoint paths such that joins for i = 1, 2, ..., k. We say that G is k-parity-linked if G is k-linked and, in addition, the paths can be chosen such that the parities of their lengths are prescribed. We prove the existence of a function g(k) such that every g(k)-connected graph is k-parity-linked if the deletion of any set of less than 4k-3 vertices leaves a nonbipartite graph. As a consequence, we obtain a result of Erdős–Pósa type for odd cycles in graphs of large connectivity. Also, every -connected graph contains a totally odd -subdivision, that is, a subdivision of in which each edge of corresponds to an odd path, if and only if the deletion of any vertex leaves a nonbipartite graph.

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received May 13, 1999/Revised June 19, 2000

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Thomassen, C. The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity. Combinatorica 21, 321–333 (2001).

Download citation

  • AMS Subject Classification (2000) Classes:  05C38, 05C40