Min-Max Theorems for Packing and Covering Odd (uv)-trails

  • Sharat Ibrahimpur
  • Chaitanya SwamyEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10328)


We investigate the problem of packing and covering odd (uv)-trails in a graph. A (uv)-trail is a (uv)-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 (uv)-trails, and \(\tau (u,v)\) denote the minimum size of an edge-set that intersects every odd (uv)-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.


  1. 1.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Churchley, R.: Personal communication (2016)Google Scholar
  4. 4.
    Churchley, R.: Odd disjoint trails and totally odd graph immersions. Ph.D. thesis, Simon Fraser University (2017).
  5. 5.
    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)Google Scholar
  6. 6.
    Geelen, J.: Personal communication (2016)Google Scholar
  7. 7.
    Ibrahimpur, S.: Packing and covering odd \((u, v)\)-trails in a graph. Master’s thesis, University of Waterloo (2016).
  8. 8.
    Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17, 369–374 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Mader, W.: Über die maximalzahl kreuzungsfreier \(H\)-Wege. Archiv der Math. 31(1), 387–402 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96–115 (1927)zbMATHGoogle Scholar
  11. 11.
    Robertson, N., Seymour, P.: Graph minors XXIII. Nash-Williams’ immersion conjecture. J. Combin. Theory Ser. B 100(2), 181–205 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Schrijver, A.: A short proof of Mader’\(\cal{S}\)-paths theorem. JCTB 82, 319–321 (2001)Google Scholar
  13. 13.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  14. 14.
    Schrijver, A., Seymour, P.D.: Packing odd paths. JCTB 62, 280–288 (1994)Google Scholar
  15. 15.
    Zaslavsky, T., Glossary of signed, gain graphs, allied areas. Electron. J. Combin., Dynamic Survey 9 5, 41 pp. (electronic) (1998)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada

Personalised recommendations