The Erdos-Posa property for odd cycles in highly connected graphs

Authors
Rautenbach, D Reed, B
Citation
D. Rautenbach et B. Reed, The Erdos-Posa property for odd cycles in highly connected graphs, COMBINATORI, 21(2), 2001, pp. 267-278
Citations number
9
Categorie Soggetti
Mathematics,"Computer Science & Engineering
Journal title
COMBINATORICA
ISSN journal
02099683 → ACNP
Volume
21
Issue
2
Year of publication
2001
Pages
267 - 278
Database
ISI
SICI code
0209-9683(2001)21:2<267:TEPFOC>2.0.ZU;2-Q
Abstract
In [9] Thomassen proved that a 2(39k)-connected graph either contains k ver tex disjoint odd cycles or an odd cycle cover containing at most 2k - 2 ver tices, i.e. he showed that the Erdos-Posa, property holds for odd cycles in highly connected graphs. In this paper, we will show that the above statem ent is still valid for 576k-connected graphs which is essentially best poss ible.