A generalisation of Menger's theorem in bidirected graphs
Combinatorics
2025-11-18 v1
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.
Cite
@article{arxiv.2511.12283,
title = {A generalisation of Menger's theorem in bidirected graphs},
author = {Ebrahim Ghorbani and Jana Katharina Nickel and Florian Reich},
journal= {arXiv preprint arXiv:2511.12283},
year = {2025}
}
Comments
6 pages, 1 figure