A generalisation of Menger's theorem in bidirected graphs

Ebrahim Ghorbani, Jana Katharina Nickel, Florian Reich

Menger's theorem - the maximum number of vertex-disjoint $X$-$Y$ paths is equal to the minimum size of an $X$-$Y$ separator - is generally not true in bidirected graphs. We prove t…