A generalisation of Menger's theorem in bidirected graphs
arXiv:2511.12283
Abstract
Menger's theorem - the maximum number of vertex-disjoint - paths is equal to the minimum size of an - separator - is generally not true in bidirected graphs. We prove that Menger's theorem holds true if we take the nontrivial - paths and the nontrivial - paths into account.
arXiv comment6 pages, 1 figure