Path decompositions of oriented graphs

Viresh Patel, Mehmet Akif Yıldız

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D…