Menger's theorem for ends of digraphs
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914463307792384 |
|---|---|
| author | Reich, Florian |
| author_facet | Reich, Florian |
| contents | Polat generalised Menger's theorem -- the maximum number of vertex-disjoint paths between two sets $A$ and $B$ equals the minimum size of an $A$-$B$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_09117 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Menger's theorem for ends of digraphs Reich, Florian Combinatorics 05C63, 05C20 Polat generalised Menger's theorem -- the maximum number of vertex-disjoint paths between two sets $A$ and $B$ equals the minimum size of an $A$-$B$ 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. |
| title | Menger's theorem for ends of digraphs |
| topic | Combinatorics 05C63, 05C20 |
| url | https://arxiv.org/abs/2604.09117 |