Abstract:Menger's theorem is one of the most fundamental results in graph theory. It states that if a graph $G$ does not contain $k$ disjoint paths between two given sets $X$ and $Y$ of vertices in $G$, then there is a set of at most $k-1$ vertices that intersects every path between $X$ and $Y$. Nguyen, Scott, and Seymour gave a counterexample to the conjectured natural coarse variant in which the paths are required to be pairwise at distance at least $d$, and, conversely, there is a set of at most $k-1$ bounded-radius balls intersecting every path between $X$ and $Y$. In other words, the coarse Menger property does not hold in general.
We prove that graphs whose cycles space is generated by cycles of bounded length do have the coarse Menger property. As a corollary, we show that many natural graphs and geodesic metric spaces have the coarse Menger property. These include hyperbolic graphs, Cayley graphs of finitely presented groups, planar graphs with bounded face size, and complete Riemannian planes.
From: Sandra Albrechtsen [view email]
[v1]
Tue, 16 Jun 2026 07:10:58 UTC (3,272 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。