Graphs with cycle spaces generated by bounded-length cycles have the coarse Menger property, with corollaries for hyperbolic graphs, finitely presented groups, and planar graphs with bounded faces.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
math.CO 6years
2026 6roles
background 2polarities
background 2representative citing papers
Verifies stronger coarse balanced separator conjecture for all r in K_{t,t}-induced-minor-free graphs of bounded clique number via a polynomial-size hitting set Z for large balls on any Y.
In planar and bounded-genus graphs, absence of k pairwise d-far S-T paths implies a vertex set of size f(d,k) whose d-neighborhood intersects every S-T path.
Locally finite graphs with an excluded finite minor have the weak coarse Menger property with f depending only on k and g linear in r independent of k.
Graphs excluding any fixed H as a d-fat minor admit balanced separators coverable by O(n^{1/2+ε}) radius-r balls, with a poly-time algorithm to find the separator or the fat model.
Every graph admits a tree decomposition with small-diameter adhesion sets where same-bag vertices cannot be separated by small, distant vertex sets.
citing papers explorer
-
A coarse Menger theorem for hyperbolic graphs, finitely presented groups, and more
Graphs with cycle spaces generated by bounded-length cycles have the coarse Menger property, with corollaries for hyperbolic graphs, finitely presented groups, and planar graphs with bounded faces.
-
Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs
Verifies stronger coarse balanced separator conjecture for all r in K_{t,t}-induced-minor-free graphs of bounded clique number via a polynomial-size hitting set Z for large balls on any Y.
-
A coarse Menger's Theorem for planar and bounded genus graphs
In planar and bounded-genus graphs, absence of k pairwise d-far S-T paths implies a vertex set of size f(d,k) whose d-neighborhood intersects every S-T path.
-
Coarse Menger property of quasi-minor excluded graphs and length spaces
Locally finite graphs with an excluded finite minor have the weak coarse Menger property with f depending only on k and g linear in r independent of k.
-
Coarse Balanced Separators in Fat-Minor-Free Graphs
Graphs excluding any fixed H as a d-fat minor admit balanced separators coverable by O(n^{1/2+ε}) radius-r balls, with a poly-time algorithm to find the separator or the fat model.
-
A coarse block-cut tree theorem
Every graph admits a tree decomposition with small-diameter adhesion sets where same-bag vertices cannot be separated by small, distant vertex sets.