Let Wt denote the wheel on t + 1 vertices. We prove that for every integer t ≥ 3 there is a constant c = c(t) such that for every integer k ≥ 1 and every graph G, either G has k vertex-disjoint subgraphs each containing Wt as a minor, or there is a subset X of at most ck log k vertices such that G - X has no Wt minor. This is best possible, up to the value of c. We conjecture that the result remains true more generally if we replace Wt with any fixed planar graph H.
- Erdos--Pósa property
- Wheel minors