Abstract
We investigate the problem of packing and covering odd (u, v)-trails in a graph. A (u, v)-trail is a (u, v)-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd. Let \(\nu (u,v)\) denote the maximum number of edge-disjoint odd (u, v)-trails, and \(\tau (u,v)\) denote the minimum size of an edge-set that intersects every odd (u, v)-trail.
We prove that \(\tau (u,v)\le 2\nu (u,v)+1\). Our result is tight—there are examples showing that \(\tau (u,v)=2\nu (u,v)+1\)—and substantially improves upon the bound of 8 obtained in [5] for \(\tau (u,v)/\nu (u,v)\). Our proof also yields a polynomial-time algorithm for finding a cover and a collection of trails satisfying the above bounds.
Our proof is simple and has two main ingredients. We show that (loosely speaking) the problem can be reduced to the problem of packing and covering odd \((\{u,v\},\{u,v\})\)-trails losing a factor of 2 (either in the number of trails found, or the size of the cover). Complementing this, we show that the odd-\((\{u,v\},\{u,v\})\)-trail packing and covering problems can be tackled by exploiting a powerful min-max result of [2] for packing vertex-disjoint nonzero A-paths in group-labeled graphs.
A full version of the paper is available on the CS arXiv.
Research supported by NSERC grant 327620-09 and an NSERC DAS Award.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chudnovsky, M., Cunningham, W.H., Geelen, J.: An algorithm for packing non-zero A-paths in group-labelled graphs. Combinatorica 28(2), 145–161 (2008)
Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L.A., Lohman, M., Seymour, P.D.: Packing non-zero A-paths in group-labelled graphs. Combinatorica 26(5), 521–532 (2006)
Churchley, R.: Personal communication (2016)
Churchley, R.: Odd disjoint trails and totally odd graph immersions. Ph.D. thesis, Simon Fraser University (2017). https://theses.lib.sfu.ca/sites/all/files/public_copies/etd9973-thesis.pdf
Churchley, R., Mohar, B., Wu, H.: Weak duality for packing edge-disjoint odd \((u, v)\)-trails. In: Proceedings of the 27th SODA, pp. 2086–2094 (2016)
Geelen, J.: Personal communication (2016)
Ibrahimpur, S.: Packing and covering odd \((u, v)\)-trails in a graph. Master’s thesis, University of Waterloo (2016). https://uwspace.uwaterloo.ca/handle/10012/10939
Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17, 369–374 (1978)
Mader, W.: Über die maximalzahl kreuzungsfreier \(H\)-Wege. Archiv der Math. 31(1), 387–402 (1978)
Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96–115 (1927)
Robertson, N., Seymour, P.: Graph minors XXIII. Nash-Williams’ immersion conjecture. J. Combin. Theory Ser. B 100(2), 181–205 (2010)
Schrijver, A.: A short proof of Mader’\(\cal{S}\)-paths theorem. JCTB 82, 319–321 (2001)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Springer, Heidelberg (2003)
Schrijver, A., Seymour, P.D.: Packing odd paths. JCTB 62, 280–288 (1994)
Zaslavsky, T., Glossary of signed, gain graphs, allied areas. Electron. J. Combin., Dynamic Survey 9 5, 41 pp. (electronic) (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ibrahimpur, S., Swamy, C. (2017). Min-Max Theorems for Packing and Covering Odd (u, v)-trails. In: Eisenbrand, F., Koenemann, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2017. Lecture Notes in Computer Science(), vol 10328. Springer, Cham. https://doi.org/10.1007/978-3-319-59250-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-59250-3_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59249-7
Online ISBN: 978-3-319-59250-3
eBook Packages: Computer ScienceComputer Science (R0)