Edge-disjoint paths in expanders: online with removals

Nemanja Draganić, Rajko Nenadov

We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong $d$-regular expander graph $G$ with $n$ vertices. In particular, we…