An edge variant of the Erdős-Pósa property

DOI10.1016/j.disc.2016.03.004zbMath1336.05108arXiv1311.1108OpenAlexW2344523505MaRDI QIDQ284717

Dimitrios M. Thilikos, Ignasi Sau, Jean-Florent Raymond

Publication date: 18 May 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1108

zbMATH Keywords

Erdős-Pósa propertycoverings in graphspackings in graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

The edge-Erdős-Pósa property ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Erdös--Pósa from Ball Packing ⋮ Packing and covering immersions in 4-edge-connected graphs ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial treewidth forces a large grid-like-minor
• Graph minors. V. Excluding a planar graph
• Treewidth. Computations and approximations
• Tree-width and planar minors
• Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles
• Edge-disjoint Odd Cycles in 4-edge-connected Graphs
• Strengthening Erdös-Pósa property for minor-closed graph classes
• Polynomial bounds for the grid-minor theorem
• On Independent Circuits Contained in a Graph
• Excluded Forest Minors and the Erdős–Pósa Property
• Polynomial gap extensions of the Erdős-Pósa theorem
• Large-treewidth graph decompositions and applications
• Hitting and Harvesting Pumpkins

This page was built for publication: An edge variant of the Erdős-Pósa property