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

Sharat Ibrahimpur, Chaitanya Swamy

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.…