Disjoint Paths in Arborescences

An arborescence in a digraph is a tree directed away from its root.A classical theorem of Edmonds characterizes which digraphs have \lambda arc-disjoint arborescences rooted at r. A similar theorem of Menger guarantees that \lambda strongly arc disjoint rv-paths exist for every vertex v, where “strongly” means that no two paths contain a pair of symmetric arcs. We prove that if a directed graph D contains two arc-disjoint spanning arborescences rooted at r, then D contains two such arborences with the property that for every node v the paths from r to v in the two arborences satisfy Menger’s theorem.