Abstract
We show the following for every sufficiently connected graph G, any vertex subset S of G, and given integer k: there are k disjoint odd cycles in G containing each a vertex of S or there is set X of at most \(3k-3\) vertices such that \(G-X\) does not contain any odd cycle that contains a vertex of S. We prove this via an extension of Kawarabayashi and Reed’s result about parity-k-linked graphs (Combinatorica 29, 215–225). From this result it is easy to deduce several other well known results about the Erdős-Pósa property of odd cycles in highly connected graphs. This strengthens results due to Thomassen (Combinatorica 21, 321–333), and Rautenbach and Reed (Combinatorica 21, 267–278), respectively. Furthermore, we consider algorithmic consequences of our results.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Birmelé, E., Bondy, J.A., Reed, B.: The Erdős-Pósa property for long circuits. Combinatorica 27, 135–145 (2007)
Bondy, J.A., Lovász, L.: Cycles through specified vertices of a graph. Combinatorica 1, 117–140 (1981)
Bruhn, H., Joos, F., Schaudt, O.: Long cycles through prescribed vertices have the Erdős-Pósa property (2014). arXiv:1412.2894
Diestel, R.: Graph Theory. GTM, vol. 173, 4th edn. Springer, Heidelberg (2010)
Dirac, G.A.: In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen. Math. Nachr. 22, 61–85 (1960)
Erdős, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Magyar Tud. Akad. Mat. Kutató Int. Közl. 6, 181–203 (1961)
Erdős, P., Pósa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3–12 (1962)
Geelen, J., Gerards, B., Reed, B., Seymour, P., Vetta, A.: On the odd-minor variant of Hadwiger’s conjecture. J. Comb. Theor. (Series B) 99, 20–29 (2009)
Kakimura, N., Kawarabayashi, K.: Half-integral packing of odd cycles through prescribed vertices. Combinatorica 33, 549–572 (2013)
Kakimura, N., Kawarabayashi, K., Marx, D.: Packing cycles through prescribed vertices. J. Comb. Theor. (Series B) 101, 378–381 (2011)
Kawarabayashi, K., Reed, B.: Highly parity linked graphs. Combinatorica 29, 215–225 (2009)
Kawarabayashi, K., Reed, B.: Odd cycle packing [extended abstract]. In: Proceedings of the 2010 ACM International Symposium on Theory of Computing, STOC 2010, pp. 695–704. ACM, New York (2010)
Kawarabayashi, K., Wollan, P.: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theor. (Series B) 96, 296–301 (2006)
Mader, W.: Existenz \(n\)-fach zusammenhängender Teilgraphen in Graphen genügend grosser Kantendichte. Abh. Math. Sem. Univ. Hamburg 37, 86–97 (1972)
Pontecorvi, M., Wollan, P.: Disjoint cycles intersecting a set of vertices. J. Comb. Theor. (Series B) 102, 1134–1141 (2012)
Rautenbach, D., Reed, B.: The Erdős-Pósa property for odd cycles in highly connected graphs. Combinatorica 21, 267–278 (2001)
Reed, B.: Mangoes and blueberries. Combinatorica 19, 267–296 (1999)
Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32, 299–301 (2004)
Robertson, N., Seymour, P.: Graph minors. V. Excluding a planar graph. J. Comb. Theor. (Series B) 41, 92–114 (1986)
Thomas, R., Wollan, P.: An improved linear edge bound for graph linkages. Eur. J. Comb. 26, 309–324 (2005)
Thomassen, C.: The Erdős-Pósa property for odd cycles in graphs of large connectivity. Combinatorica 21, 321–333 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joos, F. (2016). Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. In: Mayr, E. (eds) Graph-Theoretic Concepts in Computer Science. WG 2015. Lecture Notes in Computer Science(), vol 9224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53174-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-662-53174-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-53173-0
Online ISBN: 978-3-662-53174-7
eBook Packages: Computer ScienceComputer Science (R0)