Coarse Menger Conjecture in Infinite Graphs

• The coarse Menger conjecture is a large-scale analogue of the classical Menger theorem, addressing separation in infinite graphs through bounded-radius ball systems.
• NSS graphs, constructed from subdivided fans and binary trees, provide counterexamples by demonstrating failure of ball-based separation for three well-separated paths.
• Coarse self-similarity in NSS graphs ensures that quasi-isometric copies retain connectivity obstructions, challenging traditional minor-exclusion and structure theories.

The coarse Menger conjecture is a large-scale analogue of the classical Menger theorem, formulated to address separation and connectivity phenomena in infinite graphs and length spaces under coarse geometric constraints. It posits, roughly, that one can realize a coarse separation between two sets by boundedly many balls if and only if there do not exist many pairwise well-separated paths between them. Recent developments, particularly through counterexamples arising from Nguyen–Scott–Seymour "NSS" graph constructions, have refuted the conjecture for three or more paths and characterized the boundaries of coarse connectivity in this context.

1. Classical Menger Theorem versus Coarse Analogues

The classical Menger theorem asserts that for any two vertex sets $S,T$ in a finite graph, the maximal number of pairwise vertex-disjoint $S$–$T$ paths equals the minimal size of a vertex set separating $S$ from $T$. In the coarse or metric setting, the analogous statement proposes that, in an infinite graph or length space $(M,d)$, the existence of $k$ "well-separated" $S$–$T$ paths (for example, at distance $\ge d$ from each other) precludes the possibility of separating $S$ from $T$ by fewer than $k$ balls of bounded radius. Conversely, the lack of such separated paths should allow separation by small-radius ball systems.

2. NSS Graphs and Refutation of the Coarse Menger Conjecture

Explicit refutation of the coarse Menger conjecture is accomplished through the construction of NSS graphs $G_{k,d}$, which are recursively composed from subdivided fans and binary tree structures. Their key property is that for $k=3$ paths, any two disjoint $S$–$T$ paths in $G_{k,d}$ either come within distance $2$ of each other, or one coincides with a canonical "tree" path. Furthermore, removing any two vertices from $G_{k,d}$ leaves an $S$–$T$ path far from them, invalidating the coarse ball-separation for three-path separation. Thus, there exists a graph in which, for three paths, no system of balls of moderate radius suffices to separate $S$ from $T$, yet the $S$–$T$ connectivity cannot be realized by three pairwise well-separated paths (Albrechtsen et al., 9 Jan 2026).

Graph Family	Separation Failure	Well-Separated Path Failure
NSS $(k=3)$	No small ball system separates $S,T$	Cannot realize 3 separated paths

This construction has become central in delineating the limits of coarse connectivity.

3. Fat Minor Formulation and Coarse Self-Similarity

Fat minors generalize usual graph minors by requiring branch-sets and branch-paths in a minor model to be separated by at least a given distance $K$ (the fatness parameter), except for incidence cases. A graph $J$ is a $K$-fat minor of $G$, denoted $J\preceq_K G$, if there exists such a minor model. The NSS graphs exhibit a "coarse self-similarity" property: any graph quasi-isometric to an NSS graph necessarily contains an NSS graph as a fat minor (Albrechtsen et al., 9 Jan 2026). This result implies that key connectivity and separation phenomena propagate unchanged under quasi-isometric transformations, preserving the obstruction to ball separation in coarse settings.

4. Implications for the Fat Minor and Structural Coarse Conjectures

The coarse Menger counterexamples directly impact the Fat Minor Conjecture and related theorems, undermining broad hopes for large-scale analogues of minor-exclusion-to-structure results. Specifically, there exist small incompressible graphs—such as $K_{2,2,2}$, $K_t$ for $t\geq6$, and $K_{s,t}$ for $s,t\geq4$—for which every attempt to compress (i.e., quasi-isometrically map) a graph avoiding a $K$-fat minor to an ordinary minor-free target fails (Albrechtsen et al., 9 Jan 2026). The self-similarity of NSS graphs ensures that any quasi-isometric copy retains the same connectivity obstructions.

5. Coarse Grid and Weak Fat-Minor Theorem Failure

Analogous to the fate of the Fat Minor Conjecture, the coarse grid theorem (asserting that excluding large grid-fat minors forces quasi-isometry to bounded tree-width graphs) and the weak fat-minor conjecture (for arbitrary minor targets) are refuted by a uniform NSS-derived counterexample. For instance, Albrechtsen–Davies (Albrechtsen et al., 21 Aug 2025) construct a graph $G$ excluding the $(154\times154)$-grid as a $3$-fat minor, yet $G$ is not $(M,A)$-quasi-isometric to any graph excluding $K_n$ as a minor for any $M,A,n$, hence not to bounded tree-width graphs.

6. Boundary Cases, Surviving Forms, and Open Directions

While the coarse Menger conjecture fails in its general form, some boundaries remain unsettled. Notably, instances involving two paths or certain specific planar graphs ($K_5$, $K_{3,3}$) may yet admit coarse separation theorems, and induced minor (2-fat) settings are largely open. Theoretical interest now focuses on finding obstructions in coarse geometry that characterize quasi-isometry classes, possibly along the lines of a coarse "Ramsey-connectivity" obstruction or understanding the minimal "clique-size" for incompressibility (Albrechtsen et al., 21 Aug 2025, Albrechtsen et al., 9 Jan 2026).

7. Summary and Significance

The coarse Menger conjecture, instrumental in the development of large-scale geometric analogues for graph connectivity, has been shown invalid for three or more well-separated paths via explicit NSS-derived counterexamples (Albrechtsen et al., 9 Jan 2026). These findings delimit the applicability of ball-separation arguments and minor-exclusion based structure theory under coarse scaling, redefining the landscape of coarse graph theory and stimulating the search for more nuanced separation and connectivity paradigms.