The Erdős-Pósa property for clique minors in highly connected graphs
From MaRDI portal
Publication:412171
DOI10.1016/j.jctb.2011.08.001zbMath1239.05172arXiv1003.3915OpenAlexW1988226118MaRDI QIDQ412171
Ken-ichi Kawarabayashi, Paul Wollan, Reinhard Diestel
Publication date: 4 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.3915
Related Items
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, On the excluded minor structure theorem for graphs of large tree-width, Excluded Forest Minors and the Erdős–Pósa Property, The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs, An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\), Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(K_{6}\) minors in large 6-connected graphs
- Linear connectivity forces large complete bipartite minors
- Graph minors. V. Excluding a planar graph
- Graph minors. VII: Disjoint paths on a surface
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XVII: Taming a vortex
- An improved linear edge bound for graph linkages
- On the excluded minor structure theorem for graphs of large tree-width
