Abstract
Given a graph H, we denote by M(H) all graphs that can be contracted to H. The following extension of the Erdős-Pósa Theorem holds:for every h-vertex planar graph H, there exists a function f H: N → N such that every graph G, either contains k disjoint copies of graphs in M(H), or contains a set of f H(k) vertices meeting every subgraph of G that belongs in M(H). In this paper we prove that f H can be polynomially (upper) bounded for every graph H of pathwidth at most 2 and, in particular, that f H(k) = 2o(h 2). k 2. log k. As a main ingredient of the proof of our result, we show that for every graph H on h vertices and pathwidth at most 2, either G contains k disjoint copies of H as a minor or the treewidth of G is upper-bounded by 2o(h) 2. k 2. log k. We finally prove that the exponential dependence on h in these bounds can be avoided if H = K 2,r. In particular, we show that f K2,r = O (r 2. k 2).
Co-financed by the E.U. (European Social Fund — ESF) and Greek national funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF) — Research Funding Program:“Thales. Investing in knowledge society through the European Social Fund”.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
E. Birmelé, J. A. Bondy and B. A. Reed, The Erdős-Pósa property for long circuits, Combinatorica 27 (2007), 135–145.
C. Chekuri and J. Chuzhoy, Large-treewidth graph decompositions and applications, In:“45st Annual ACM Symposium on Theory of Computing”, (STOC 2013), 2013.
R. Diestel, “Graph Theory”, volume 173 of Graduate Texts in Mathematics, Springer-Verlag, Heidelberg, fourth edition, 2010.
R. Diestel, T. R. Jensen, K. Yu. Gorbunov and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B 75(1) (1999), 61–73.
P. Erdős and G. Szekeres, A combinatorial problem in geometry, In:“Classic Papers in Combinatorics”, Ira Gessel and Gian-Carlo Rota (eds.), Modern Birkhäuser Classics, Birkhäuser Boston, 1987, 49–56.
P. Erdős and L. Pósa, On independent circuits contained in a graph, Canad. J. Math. 17 (1965), 347–352.
S. Fiorini, T. Huyhn and G. Joret, personal communication, 2013.
S. Fiorini, G. Joret and I. Sau, Optimal Erdős-Pósa property for pumpkins, Manuscript, 2013.
F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip and S. Saurabh, Quadratic upper bounds on the Erdős-Pósa property for a generalization of packing and covering cycles, Journal of Graph Theory, to appear in 2013.
F. V. Fomin, S. Saurabh and D. M. Thilikos, Strengthening Erdős-Pósa property for minor-closed graph classes, Journal of Graph Theory 66(3) (2011), 235–240.
J. Geelen and K. Kabell, The Erdős-Pósa property for matroid circuits, J. Comb. Theory Ser. B 99(2) (2009), 407–19.
Ken-ichi Kawarabayashi and Y. Kobayashi, Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid, In:“29th Int. Symposium on Theoretical Aspects of Computer Science (STACS 2012)”, Vol. 14 of LIPIcs, Dagstuhl, Germany, 2012, 278–289.
A. Leaf and P. Seymour, Treewidth and planar minors, Manuscript, 2012.
N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Series B 41(2) (1986), 92–114.
D. R. Wood Samuel Fiorini and G. Joret, Excluded forest minors and the Erdős-Pósa property, Technical report, Cornell University, 2012.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Raymond, JF., Thilikos, D.M. (2013). Polynomial gap extensions of the Erdős-Pósa theorem. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_3
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_3
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)