On an induced version of Menger's theorem
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911235351511040 |
|---|---|
| author | Hendrey, Kevin Norin, Sergey Steiner, Raphael Turcotte, Jérémie |
| author_facet | Hendrey, Kevin Norin, Sergey Steiner, Raphael Turcotte, Jérémie |
| contents | We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs of bounded maximum degree and, more generally, for graphs excluding a topological minor. We further show better bounds in the subcubic case, and in particular obtain a tight result for two paths using a computer-assisted proof. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_07905 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On an induced version of Menger's theorem Hendrey, Kevin Norin, Sergey Steiner, Raphael Turcotte, Jérémie Combinatorics 05C38 (Primary) 05C15, 05C40, 05C83 (Secondary) We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs of bounded maximum degree and, more generally, for graphs excluding a topological minor. We further show better bounds in the subcubic case, and in particular obtain a tight result for two paths using a computer-assisted proof. |
| title | On an induced version of Menger's theorem |
| topic | Combinatorics 05C38 (Primary) 05C15, 05C40, 05C83 (Secondary) |
| url | https://arxiv.org/abs/2309.07905 |