A generalisation of Menger's theorem in bidirected graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914159999844352 |
|---|---|
| author | Ghorbani, Ebrahim Nickel, Jana Katharina Reich, Florian |
| author_facet | Ghorbani, Ebrahim Nickel, Jana Katharina Reich, Florian |
| contents | Menger's theorem - the maximum number of vertex-disjoint $X$-$Y$ paths is equal to the minimum size of an $X$-$Y$ separator - is generally not true in bidirected graphs. We prove that Menger's theorem holds true if we take the nontrivial $X$-$X$ paths and the nontrivial $Y$-$Y$ paths into account. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12283 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A generalisation of Menger's theorem in bidirected graphs Ghorbani, Ebrahim Nickel, Jana Katharina Reich, Florian Combinatorics 05C40, 05C38, 05C20 Menger's theorem - the maximum number of vertex-disjoint $X$-$Y$ paths is equal to the minimum size of an $X$-$Y$ separator - is generally not true in bidirected graphs. We prove that Menger's theorem holds true if we take the nontrivial $X$-$X$ paths and the nontrivial $Y$-$Y$ paths into account. |
| title | A generalisation of Menger's theorem in bidirected graphs |
| topic | Combinatorics 05C40, 05C38, 05C20 |
| url | https://arxiv.org/abs/2511.12283 |