Min-Max Theorems for Packing and Covering Odd $(u,v)$-trails

TL;DR

This paper establishes a tight min-max relation between packing and covering odd $(u,v)$-trails in graphs, providing a polynomial-time algorithm and significantly improving previous bounds.

Contribution

It proves a tight bound $ au(u,v) \\leq 2 u(u,v)+1$ for odd $(u,v)$-trail packing and covering, with a new simple proof and algorithmic implications.

Findings

Proved the bound \\tau(u,v) \\leq 2 u(u,v)+1$ is tight.

Developed a polynomial-time algorithm for packing and covering odd $(u,v)$-trails.

Improved previous bounds from 8 to a tight relation.

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)\leq 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 [Churchley et al 2016] 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 $(uv,uv)$-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-$(uv,uv)$-trail packing and covering problems can be tackled by exploiting a powerful min-max result of [Chudnovsky et al 2006] for packing vertex-disjoint nonzero $A$-paths in group-labeled graphs.