Long Cycles have the Edge-Erdős-Pósa Property
We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer ℓ ≥ 3 and every k ∈ ℕ, every graph G either contains k edge-disjoint cycles of length at least ℓ (long cycles) or an edge set X of size O(k2 logk+kℓ) such that G—X does not contain any long cycle. This answers a question of Birmelé, Bondy, and Reed (Combinatorica 27 (2007), 135-145).
Mathematics Subject Classification (2010)05C70
Unable to display preview. Download preview PDF.
- T. Huynh, F. Joos and P. Wollan: A unified Erdős-Pósa theorem for constrained cycles, to appear in Combinatorica.Google Scholar
- C.-H. Liu: Packing and Covering immersions in 4-Edge-Connected Graphs, arXiv:1505.00867 (2015).Google Scholar
- J.-F. Raymond and D. Thilikos: Recent techniques and results on the Erdős–Pósa property, to appear in Disc. App. Math.Google Scholar