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

DOI10.1007/s004930100024zbMath0981.05066OpenAlexW2076192760MaRDI QIDQ5955201

Bruce A. Reed, Dieter Rautenbach

Publication date: 13 February 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930100024

zbMATH Keywords

Erdős-Pósa propertyhighly connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (22)

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Edge-disjoint odd cycles in planar graphs. ⋮ Packing cycles with modularity constraints ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ Non-zero disjoint cycles in highly connected group labeled graphs ⋮ Two disjoint negative cycles in a signed graph

This page was built for publication: The Erdős-Pósa property for odd cycles in highly connected graphs