Coarse Grid Theorem: Structures & Applications

• Coarse Grid Theorem is a family of theorem-schemas that characterize grid-like structures in large-scale graphs and numerical methods.
• In graph theory, it encompasses refuted conjectures using fat minors, positive results like the coarse Halin grid theorem, and quasi-isometric reductions.
• In numerical linear algebra, it underpins coarse-grid approximations for domain decomposition, ensuring optimal convergence and high-order rediscretization.

Searching arXiv for papers on "coarse grid theorem", "counterexample coarse grid theorem", and related graph theory / numerical linear algebra usages. “Coarse Grid Theorem” appears in the papers considered here in several distinct settings. In large-scale graph theory it names a conjectured coarse analogue of the Robertson–Seymour grid theorem, formulated using fat minors and quasi-isometry, and it is now known to be false in that form (Albrechtsen et al., 21 Aug 2025). In the same broad area, positive coarse grid phenomena survive under different hypotheses, notably in the coarse Halin grid theorem for asymptotic minors (Albrechtsen et al., 17 Jul 2025). In numerical linear algebra, the phrase refers to a coarse-grid approximation theorem for a Galerkin coarse problem constructed from a discontinuous, subdomainwise polynomial basis (Edwards et al., 2015). This suggests that the term is best understood as a family of theorem-schemas about grid-like structure or coarse-level approximation, rather than as a single canonical result.

1. Graph-theoretic formulation: fat grids, quasi-isometry, and bounded tree-width

The conjectured coarse grid theorem of Georgakopoulos and Papasoglu was formulated as follows: for every $K,n \in \mathbb{N}$, there exist $M,A,g \in \mathbb{N}$ such that every graph with no $K$-fat $(n\times n)$-grid minor is $(M,A)$-quasi-isometric to a graph of tree-width at most $g$ (Albrechtsen et al., 21 Aug 2025). The intended meaning was that the absence of a sufficiently coarse grid minor should force bounded tree-width after passage to a quasi-isometric model.

The coarse notion of minor used here is a $K$-fat minor model. A model of a graph $X$ in a graph $G$ consists of disjoint connected branch sets $U_x$ for $M,A,g \in \mathbb{N}$0 and branch paths $M,A,g \in \mathbb{N}$1 for $M,A,g \in \mathbb{N}$2, joining the appropriate branch sets and internally disjoint from all other branch sets. The model is $M,A,g \in \mathbb{N}$3-fat if distinct objects in the model are pairwise at distance at least $M,A,g \in \mathbb{N}$4, except that a branch path may meet its two incident branch sets at endpoints (Albrechtsen et al., 21 Aug 2025). This is the large-scale replacement for ordinary minors in the conjecture.

The quasi-isometric side of the statement is equally central. For $M,A,g \in \mathbb{N}$5 and $M,A,g \in \mathbb{N}$6, an $M,A,g \in \mathbb{N}$7-quasi-isometry $M,A,g \in \mathbb{N}$8 satisfies

$M,A,g \in \mathbb{N}$9

and every vertex of $K$0 lies within distance $K$1 of some $K$2 (Albrechtsen et al., 21 Aug 2025). The conjecture therefore mixed two kinds of coarse structure: exclusion of a fat grid minor on one side, and quasi-isometric reduction to bounded-tree-width geometry on the other.

A useful technical consequence recorded in the counterexample paper is that connected sets remain coarsely connected under quasi-isometry, and coarse separators are preserved after an explicit thickening. If $K$3 separates $K$4 and $K$5 in $K$6, then

$K$7

separates $K$8 and $K$9 in $(n\times n)$0 (Albrechtsen et al., 21 Aug 2025). This separator-transport principle is one of the mechanisms through which the conjecture was tested.

2. Refutation of the conjectured coarse grid theorem

The conjecture is refuted by the theorem that for every $(n\times n)$1 with $(n\times n)$2, there exists a graph $(n\times n)$3 such that the $(n\times n)$4-grid is not a $(n\times n)$5-fat minor of $(n\times n)$6, and $(n\times n)$7 is not $(n\times n)$8-quasi-isometric to any graph with no $(n\times n)$9 minor (Albrechtsen et al., 21 Aug 2025). Since quasi-isometry to bounded-tree-width graphs would in particular imply quasi-isometry to graphs excluding large clique minors, this directly contradicts the conjectured conclusion.

The construction is a recursively defined family $(M,A)$0, described as a slight modification of the recent counterexample to the weak coarse Menger conjecture from Nguyen, Scott and Seymour (Albrechtsen et al., 21 Aug 2025). At the base level $(M,A)$1 consists of a binary tree of height $(M,A)$2, a long base path, and spine paths from leaves to the base path. For $(M,A)$3, the graph is built from a chain of copies of $(M,A)$4, a new binary tree, and additional spines. The crucial modification is that the construction does not include the dotted shortcut paths between the $(M,A)$5-vertices or the $(M,A)$6-vertices, and likewise not between the $(M,A)$7. The paper notes that with those shortcuts the construction would contain every graph as a fat minor; deleting them preserves the intended bottlenecks (Albrechtsen et al., 21 Aug 2025).

Two structural lemmas drive the argument. First, if $(M,A)$8 are paths between $(M,A)$9 and $g$0, then either one of them passes through the root $g$1, or $g$2 (Albrechtsen et al., 21 Aug 2025). Second, for suitable $g$3, every set $g$4 of fewer than $g$5 vertices leaves an $g$6-$g$7 path $g$8 with

$g$9

(Albrechtsen et al., 21 Aug 2025). Together these statements show that the graph retains strong separator obstructions while refusing the sort of large-scale linkedness that a fat grid would force.

The exclusion of the $K$0-fat $K$1-grid is proved via a local obstruction and a tree-decomposition argument. Locally, no set $K$2 inside $K$3 contains a $K$4-fat $K$5-path-connected set (Albrechtsen et al., 21 Aug 2025). Globally, a supposed $K$6-fat grid model would produce a row yielding a $K$7-fat $K$8-path-connected set, and the tree decomposition forces a large subset of that row into one of the forbidden local pieces. The contradiction shows that the graph avoids the prescribed fat grid.

The second half of the theorem shows that this grid avoidance does not permit quasi-isometric simplification to any $K$9-minor-free graph. Assuming an $X$0-quasi-isometry $X$1, the separator transport lemma and the recursive structure of $X$2 are used to produce many disjoint $X$3-$X$4 paths in $X$5, then to force them through a family of coarse separators, and finally to assemble a $X$6 minor in $X$7 (Albrechtsen et al., 21 Aug 2025). The broader conclusion stated in the paper is that absence of a large fat grid minor does not force a graph to be quasi-isometric to bounded-tree-width graphs.

3. Positive coarse grid phenomena: the coarse Halin grid theorem

A different large-scale grid theorem survives in the setting of asymptotic minors. The paper “A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs” proves that every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor (Albrechtsen et al., 17 Jul 2025). More precisely, if $X$8 is one-ended and locally finite and $X$9, then $G$0.

The underlying minor relation is again coarse. A graph $G$1 is an asymptotic minor of $G$2, written $G$3, if $G$4 is a $G$5-fat minor of $G$6 for every $G$7 (Albrechtsen et al., 17 Jul 2025). The paper also works with end-specific models $G$8, diverging minors, and ultra-fat minors. The quantitative form of the main theorem states that if

$G$9

then

$U_x$0

and if $U_x$1 contains $U_x$2-rays $U_x$3 such that

$U_x$4

then

$U_x$5

(Albrechtsen et al., 17 Jul 2025).

The paper emphasizes that the correct coarse analogue of Halin’s theorem is not phrased directly in terms of thick ends. In the coarse setting, having a thick end alone is not enough in general: there are graphs with a thick end that do not contain the half-grid as an asymptotic minor (Albrechtsen et al., 17 Jul 2025). The right hypothesis is the presence of $U_x$6 as an asymptotic minor, together with geometric control on the ray-models. In the general, non-locally-finite case, two additional assumptions are imposed: the rays must be equivalent, and no two rays may be separated by deleting finitely many balls of finite radius (Albrechtsen et al., 17 Jul 2025).

The proof strategy is explicitly structural. Infinitely many coarse-disjoint rays are upgraded to a subdivision of the hexagonal half-grid, then contracted to a $U_x$7-fat half-grid minor while preserving the fatness constraints (Albrechtsen et al., 17 Jul 2025). For one-ended quasi-transitive locally finite graphs, the paper proves a stronger application: $U_x$8 Consequently such graphs contain the half-grid as an asymptotic minor and as a diverging minor; this includes all locally finite Cayley graphs of one-ended finitely generated groups (Albrechtsen et al., 17 Jul 2025).

4. Related exact and grid-type theorems in graph structure theory

The coarse graph-theoretic discussion sits beside several exact or non-coarse grid theorems. The “Directed Grid Theorem” proves the full directed analogue of the Robertson–Seymour grid theorem: there is a function $U_x$9 such that every digraph of directed tree-width at least $M,A,g \in \mathbb{N}$00 contains a cylindrical grid of order $M,A,g \in \mathbb{N}$01 as a butterfly minor (Kawarabayashi et al., 2014). Equivalently, large bramble order forces a cylindrical grid as a butterfly minor. The theorem uses the modified version of directed tree-width with possibly empty bags, and this directed tree-width is closed under butterfly minors: $M,A,g \in \mathbb{N}$02 (Kawarabayashi et al., 2014).

The directed theorem is not formally called a coarse grid theorem. The paper explicitly states that it does not use that phrase as a formal named theorem, and that the result is the full structural analogue of the undirected grid theorem rather than a weaker approximation (Kawarabayashi et al., 2014). At the same time, its proof architecture passes through intermediate grid-like objects—webs, fences, pseudo-fences, and acyclic grids—before producing a cylindrical grid. The structural backbone is summarized as: $M,A,g \in \mathbb{N}$03 (Kawarabayashi et al., 2014). This suggests that “coarse grid” intuition may arise inside proofs even when the final theorem is exact.

A different nearby development is the induced-subgraph grid theorem for perforated graphs. For all $M,A,g \in \mathbb{N}$04 and $M,A,g \in \mathbb{N}$05, there exists

$M,A,g \in \mathbb{N}$06

such that every $M,A,g \in \mathbb{N}$07-free $M,A,g \in \mathbb{N}$08-perforated graph $M,A,g \in \mathbb{N}$09 with $M,A,g \in \mathbb{N}$10 contains a full $M,A,g \in \mathbb{N}$11-occultation (Alecu et al., 2023). In the $M,A,g \in \mathbb{N}$12-perforated case, the resulting obstruction theory says that a graph has large treewidth if and only if it contains, as an induced subgraph, either a large complete graph, or a large complete bipartite graph, or a large full occultation (Alecu et al., 2023). The paper emphasizes that this is the first grid theorem for a hereditary induced-subgraph class that requires an obstruction other than subdivided walls and their line graphs.

Taken together, these results show that grid theorems in modern graph structure theory may involve ordinary minors, butterfly minors, asymptotic minors, or induced subgraphs, and that the “grid” itself may be a cylindrical grid, a half-grid, or a full occultation (Kawarabayashi et al., 2014, Albrechtsen et al., 17 Jul 2025, Alecu et al., 2023).

5. Numerical linear algebra usage: coarse-grid approximation in domain decomposition

In domain decomposition, “coarse grid theorem” refers to a different theorem entirely. The paper “The Discretely-Discontinuous Galerkin Coarse Grid for Domain Decomposition” starts from a symmetric positive definite linear system

$M,A,g \in \mathbb{N}$13

partitions the discrete domain into non-overlapping subdomains

$M,A,g \in \mathbb{N}$14

and constructs a coarse basis from the restriction of user-supplied generating vectors $M,A,g \in \mathbb{N}$15 to each subdomain (Edwards et al., 2015). For subdomain $M,A,g \in \mathbb{N}$16, the basis functions are

$M,A,g \in \mathbb{N}$17

the global coarse space is

$M,A,g \in \mathbb{N}$18

and the Galerkin coarse operator is

$M,A,g \in \mathbb{N}$19

The central theorem of Section 4, “Coarse Grid Analysis,” states that under moderate regularity assumptions the coarse Galerkin solution satisfies

$M,A,g \in \mathbb{N}$20

for PDEs of degree $M,A,g \in \mathbb{N}$21 (Edwards et al., 2015). The paper interprets this as showing that the coarse space is not just stable, but a high-order rediscretization of the fine PDE.

The proof uses Galerkin best approximation and a domain split into an interior region $M,A,g \in \mathbb{N}$22 and a thin interface region $M,A,g \in \mathbb{N}$23. Inside each subdomain, the coarse basis reproduces degree-$M,A,g \in \mathbb{N}$24 polynomials, yielding

$M,A,g \in \mathbb{N}$25

Near interfaces, the basis is discontinuous, but the bad region has small measure, and the interface contribution is controlled by

$M,A,g \in \mathbb{N}$26

(Edwards et al., 2015). The same argument also yields an algebraic version in terms of $M,A,g \in \mathbb{N}$27.

This coarse-grid theorem is then tied to a two-level symmetric multiplicative overlapping Schwarz preconditioner. The paper reports optimal scaling, with convergence requiring a constant number of iterations, independent of fine problem size, on a range of scalar and vector-valued second-order and fourth-order PDEs (Edwards et al., 2015). Here “coarse grid” does not mean a graph-theoretic minor; it means a Galerkin coarse correction designed to approximate the error left after local Schwarz smoothing.

6. Conceptual status of the term

The current state of the graph-theoretic story is sharply split. The clean conjectured coarse grid theorem based on excluding a fat grid minor and demanding quasi-isometric bounded tree-width is false (Albrechtsen et al., 21 Aug 2025). By contrast, strong positive statements do hold for asymptotic minors, especially when one works with $M,A,g \in \mathbb{N}$28, one-ended locally finite graphs, and ultra-fat or diverging models of the half-grid (Albrechtsen et al., 17 Jul 2025).

This division matters for interpretation. The counterexample shows that a straightforward coarse translation of the classical Robertson–Seymour paradigm is too optimistic (Albrechtsen et al., 21 Aug 2025). The coarse Halin theorem shows that robust large-scale grid forcing remains possible, but only after replacing the input and output notions by more carefully controlled asymptotic minors (Albrechtsen et al., 17 Jul 2025). The nearby directed and perforated-graph theorems indicate that exact structural theorems often require changing the minor notion, the grid object, or the obstruction family itself (Kawarabayashi et al., 2014, Alecu et al., 2023).

Outside graph theory, the same phrase designates a mathematically unrelated result about coarse-level approximation quality in multilevel solvers (Edwards et al., 2015). This suggests that “Coarse Grid Theorem” is not a single theorem with a fixed statement, but a context-dependent label for results in which a coarse-scale object—a fat grid, a half-grid, a cylindrical grid, an occultation, or a Galerkin coarse space—controls the large-scale structure of the underlying problem.