Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Let ℋ︁ and 𝒢 be graph classes. We say that ℋ︁ has the Erdős–Pósa property for 𝒢 if for any graph G ∈𝒢, the minimum vertex covering of all ℋ︁-subgraphs of G is bounded by a function f of the maximum packing of ℋ︁-subgraphs in G (by ℋ︁-subgraph of G we mean any subgraph of G that belongs to ℋ︁). Robertson and Seymour [J Combin Theory Ser B 41 (1986), 92–114] proved that if ℋ︁ is the class of all graphs that can be contracted to a fixed planar graph H, then ℋ︁ has the Erdős–Pósa property for the class of all graphs with an exponential bounding function. In this note, we prove that this function becomes linear when 𝒢 is any non-trivial minor-closed graph class. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:235-240, 2011 © 2011 Wiley Periodicals, Inc.