A Tight Erdös--Pósa Function for Wheel Minors

DOI10.1137/17M1153169zbMath1395.05130arXiv1710.06282MaRDI QIDQ5374439

Samuel Fiorini, Jean-Florent Raymond, Gwenaël Joret, Pierre Aboulker, Ignasi Sau, Tony Huynh

Publication date: 14 September 2018

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

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

zbMATH Keywords

Erdős-Pósa propertypacking and coveringwheel minors

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property

Cites Work

• Unnamed Item
• Small complete minors above the extremal edge density
• Small minors in dense graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• Graph minors. V. Excluding a planar graph
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
• A tight Erdős-Pósa function for long cycles
• Recent techniques and results on the Erdős-Pósa property
• The Erdős-Pósa property for long circuits
• A Tighter Erdős-Pósa Function for Long Cycles
• Polynomial Bounds for the Grid-Minor Theorem
• An extremal function for contractions of graphs
• On the presence of disjoint subgraphs of a specified type
• Logarithmically small minors and topological minors
• On Independent Circuits Contained in a Graph
• Excluded Forest Minors and the Erdős–Pósa Property
• Large-treewidth graph decompositions and applications

This page was built for publication: A Tight Erdös--Pósa Function for Wheel Minors