On an induced version of Menger's theorem
Combinatorics
2025-10-29 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2309.07905,
title = {On an induced version of Menger's theorem},
author = {Kevin Hendrey and Sergey Norin and Raphael Steiner and Jérémie Turcotte},
journal= {arXiv preprint arXiv:2309.07905},
year = {2025}
}
Comments
14 pages, 4 figures