Menger's theorem is extended to ends of digraphs, equating the maximum number of disjoint paths between ends to the minimum separator size, and applied to characterize the combined degree of ends.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Menger's theorem for ends of digraphs
Menger's theorem is extended to ends of digraphs, equating the maximum number of disjoint paths between ends to the minimum separator size, and applied to characterize the combined degree of ends.