Menger's theorem for ends of digraphs
Combinatorics
2026-04-13 v1
Abstract
Polat generalised Menger's theorem -- the maximum number of vertex-disjoint paths between two sets and equals the minimum size of an - separator -- to ends of undirected graphs. In this paper we extend Menger's theorem to ends of digraphs. As an application, we characterise the combined degree of ends of digraphs.
Keywords
Cite
@article{arxiv.2604.09117,
title = {Menger's theorem for ends of digraphs},
author = {Florian Reich},
journal= {arXiv preprint arXiv:2604.09117},
year = {2026}
}
Comments
14 pages, 1 figure