Asymptotic Minor and Coarse Graph Structures

• Asymptotic Minor is a large-scale graph concept that uses K-fat minor models to enforce separation between branch-sets at every prescribed scale.
• It links coarse geometry with metric graph invariants by strengthening ordinary minor conditions through distance constraints and quasi-isometric implications.
• The framework yields bounded strong isometric path complexity and characterizes grid-like patterns in infinite graphs, influencing large-scale graph analysis.

Searching arXiv for papers directly defining and using asymptotic minors. arxiv_search(query="^^^^^^^^3all:\3 minor\"^^^^^^^^3 OR ti:\3^^^^^^^^"asymptotic minor\"^^^^^^^^3 OR abs:\3^^^^^^^^"asymptotic minor\"", max_results=^^^^3 OR ti:\3all:\3^^^^) Reviewing the most relevant hits for definitions, foundational context, and recent developments. An asymptotic minor is a coarse-geometric analogue of an ordinary graph minor in which the branch-sets and branch-paths of a minor model are required not merely to be disjoint, but to remain far apart at a prescribed scale. In the formulation used in recent work, one asks for a PRESERVED_PLACEHOLDER_^^^^3all:\3^^^^-fat minor model of a graph PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^ inside a graph PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^: the pieces representing vertices and edges of $H$ must be connected, incident pieces must meet appropriately, and every other pair of distinct pieces must be at distance at least $K$ in $G$ (&&&^^^^3all:\3^^^^&&&). A graph class contains $H$ as an asymptotic minor if such a $K$-fat model exists for every integer $K\ge 1$; otherwise the class is $H$-asymptotic minor-free (&&&^^^^3all:\3^^^^&&&). This notion belongs to the large-scale, or “coarse,” theory of graphs and has been used to relate quasi-isometry, large-scale dimension, end structure, and distance-based graph invariants (&&&^^^^3all:\3^^^^&&&, Albrechtsen et al., 2024).

^^^^3 OR ti:\3^^^^. Formal notion

Recent work formulates asymptotic minors through the intermediate concept of a PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3all:\3^^^^-fat minor (&&&^^^^3all:\3^^^^&&&). Let PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3 OR ti:\3^^^^ and PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3 OR abs:\3^^^^ be graphs and PRESERVED_PLACEHOLDER_^^^^3 OR ti:\33^^^^ a positive integer. A PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^4-fat minor model of PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^5 in PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^6 is a collection

PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^7

of connected subgraphs of PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^8, called branch-sets and branch-paths, such that for each edge PRESERVED_PLACEHOLDER_^^^^3 OR ti:\3^^^^9, both PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3all:\3^^^^ and PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3 OR ti:\3^^^^ meet PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3 OR abs:\3^^^^, and whenever PRESERVED_PLACEHOLDER_^^^^3 OR abs:\33^^^^ are two distinct members of the model that are not one of the forced incident pairs PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^4 or PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^5, their distance in PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^6 is at least PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^7 (&&&^^^^3all:\3^^^^&&&). Here

PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^8

This recovers the usual notion of a minor when the separation parameter is minimal: in the corresponding “fat minor” framework, when PRESERVED_PLACEHOLDER_^^^^3 OR abs:\3^^^^9, one recovers the usual notion of minor (Hickingbotham, 8 Aug 2025). The asymptotic-minor relation is then defined at the level of graph classes: a class $H$^^^^3all:\3^^^^ contains $H$^^^^3 OR ti:\3^^^^ as an asymptotic minor if for every integer $H$^^^^3 OR abs:\3^^^^ there exists $H$3 admitting a $H$4-fat minor model of $H$5; otherwise $H$6 is $H$7-asymptotic minor-free (&&&^^^^3all:\3^^^^&&&).

This definition is designed to capture large-scale structure rather than local embedding. The intended intuition, stated explicitly in the literature, is that $H$8-asymptotic minor-free means that, “looked at from far away,” members of the class never resemble a graph that contracts to $H$9 in the minor sense (&&&^^^^3all:\3^^^^&&&). A plausible implication is that asymptotic minor exclusion is naturally adapted to quasi-isometric and metric questions in a way ordinary minor exclusion is not.

^^^^3 OR abs:\3^^^^. Relation to minors, fat minors, and coarse graph structure

The asymptotic-minor framework strengthens ordinary minor containment by imposing large pairwise distances between non-incident pieces. In the fat-minor terminology, an $K$^^^^3all:\3^^^^-fat minor model of $K$^^^^3 OR ti:\3^^^^ in $K$^^^^3 OR abs:\3^^^^ consists of connected subgraphs

$K$3

satisfying the incidence condition and the separation requirement

$K$4

for all pairs of distinct pieces $K$5 not forced to touch by incidence (Hickingbotham, 8 Aug 2025). The same source emphasizes the interpretation: when $K$6 is large, the model requires the pieces to keep far apart (Hickingbotham, 8 Aug 2025).

This perspective places asymptotic minors alongside other large-scale graph invariants. In particular, “coarse” or “large-scale” geometry of graphs uses asymptotic minors as a structural language for graph classes whose geometry is studied up to large-scale distortion (&&&^^^^3all:\3^^^^&&&). The notion is therefore distinct from induced minors, topological minors, or ordinary minors, even though the model-building syntax resembles those relations. The distinction is substantive: asymptotic minor exclusion concerns the existence of minor models at arbitrarily large scales, not merely finite combinatorial containment (&&&^^^^3all:\3^^^^&&&).

A related notion appearing in the literature is that of a diverging minor. For locally finite, quasi-transitive graphs with a thick end and bounded-length cycle-space generators, the full-grid occurs both as an asymptotic minor and as a diverging minor; under finite maximum degree without quasi-transitivity, the half-grid occurs both as an asymptotic minor and as a diverging minor (Albrechtsen et al., 2024). The abstract does not supply the formal definition of diverging minor, but its pairing with asymptotic minor indicates that both notions are intended to capture large-scale recurring structure in infinite graphs.

3. Canonical excluded and unavoidable patterns

Small graphs play a central role as test objects for asymptotic minor exclusion. One of the principal examples is the graph $K$7, defined as the graph obtained by adding a universal vertex to a path of $K$8 edges (&&&^^^^3all:\3^^^^&&&). A central theorem states that for every $K$9 and $G$^^^^3all:\3^^^^, if a graph $G$^^^^3 OR ti:\3^^^^ does not contain $G$^^^^3 OR abs:\3^^^^ as a $G$3-fat minor, then its strong isometric path complexity is bounded by a function of $G$4 and $G$5 (&&&^^^^3all:\3^^^^&&&). The same paper notes that $G$6-asymptotic minor-free implies $G$7-asymptotic minor-free, yielding a corresponding boundedness result for $G$8-asymptotic minor-free graphs (&&&^^^^3all:\3^^^^&&&).

Another recurrent obstruction is $G$9, the graph obtained from $H$^^^^3all:\3^^^^ by deleting an edge. The literature cited in the same work states that a graph is quasi-isometric to a cactus if and only if it is $H$^^^^3 OR ti:\3^^^^-asymptotic minor-free, equivalently $H$^^^^3 OR abs:\3^^^^-asymptotic minor-free (&&&^^^^3all:\3^^^^&&&). This is a coarse-geometric characterization rather than a local forbidden-subgraph statement.

By contrast, ordinary minor exclusion does not imply bounded behavior for the same metric invariant. The same source states that $H$3-minor-free graphs have unbounded strong isometric path complexity, and explains this via the presence of arbitrarily large planar grids in the class (&&&^^^^3all:\3^^^^&&&). This contrast is conceptually important: asymptotic minor exclusion can be much more restrictive at large scale than exclusion of the corresponding ordinary minor.

The grid and half-grid also appear as canonical asymptotic minors in infinite-graph structure theory. Every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor (Albrechtsen et al., 2024). More generally, every graph of finite maximum degree with a thick end and whose cycle space is generated by cycles of bounded length contains the half-grid as an asymptotic minor and as a diverging minor (Albrechtsen et al., 2024). This places grids in the same structural role they often play in ordinary minor theory, but now at the level of ends and large-scale recurrence.

4. Structural theorems for infinite graphs

The ^^^^3 OR abs:\3all:\3 OR abs:\3^^^^4 paper “Asymptotic half-grid and full-grid minors” proves two large-scale existence theorems for infinite graphs (Albrechtsen et al., 2024). The first states that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor (Albrechtsen et al., 2024). The second removes quasi-transitivity but strengthens the degree hypothesis: every graph of finite maximum degree which has a thick end and whose cycle space is generated by cycles of bounded length contains the half-grid as an asymptotic minor and as a diverging minor (Albrechtsen et al., 2024).

The abstract further notes that the first theorem includes all locally finite Cayley graphs of finitely presented groups (Albrechtsen et al., 2024). This places asymptotic minors in direct contact with geometric group theory. A plausible implication is that the presence of thick ends together with bounded-length cycle generators provides enough repetitive large-scale combinatorial structure to force grid-like asymptotic models.

The same abstract states that these results partially solve problems of Georgakopoulos and Papasoglu and of Georgakopoulos and Hamann (Albrechtsen et al., 2024). The formulation strongly suggests that asymptotic minors were introduced to address questions about the large-scale structure of infinite graphs, especially those formulated in terms of ends and coarse geometry.

Because the source text available here is limited to the abstract, the formal definitions of thick end, half-grid, full-grid, and diverging minor are not reproduced. The proven content available, however, is already enough to identify a major theme: under bounded local complexity and suitable end structure, asymptotic minors force large two-dimensional patterns.

5. Interaction with metric invariants and path structure

Asymptotic minor exclusion has concrete consequences for metric graph parameters. The strongest such connection in the supplied corpus concerns strong isometric path complexity. This invariant measures how arbitrary isometric paths can be covered by rooted isometric paths sharing a common endpoint (&&&^^^^3all:\3^^^^&&&). The paper proves that the strong isometric path complexity of $H$4-asymptotic minor-free graphs is bounded, and more generally that every graph avoiding $H$5 as a $H$6-fat minor has strong isometric path complexity at most some function $H$7 (&&&^^^^3all:\3^^^^&&&).

The proof strategy runs in contrapositive form. Starting from a graph with large strong isometric path complexity, one fixes a root $H$8, orients the graph using a BFS layering, and uses a Dilworth-type argument to find an isometric path containing a large antichain (&&&^^^^3all:\3^^^^&&&). From that antichain one selects well-separated vertices, constructs induced paths from these vertices to the root, trims them into subpaths that remain mutually far apart, and combines them with long connecting subpaths along the original isometric path to assemble a $H$9-fat minor model of $K$^^^^3all:\3^^^^ (&&&^^^^3all:\3^^^^&&&). The significance of the argument is that it realizes asymptotic minor models directly from combinatorial manifestations of distance complexity.

The same paper provides both positive and negative examples. Monoholed graphs, meaning graphs whose every induced cycle of length at least $K$^^^^3 OR ti:\3^^^^ has the same length, are shown to form a subclass of $K$^^^^3 OR abs:\3^^^^-asymptotic minor-free graphs; hence they have bounded strong isometric path complexity (&&&^^^^3all:\3^^^^&&&). On the other hand, even-hole-free graphs of maximum degree $K$3 have unbounded isometric path complexity, and therefore unbounded strong isometric path complexity (&&&^^^^3all:\3^^^^&&&). These results demonstrate that asymptotic minor exclusion is neither reducible to ordinary hole restrictions nor implied by familiar sparse-minor conditions.

The same source also states that strong isometric path complexity is preserved under fixed power, line graph, and clique-sums operators (&&&^^^^3all:\3^^^^&&&). This does not directly assert closure of asymptotic minor-freeness under those operations, but it shows that once asymptotic minor exclusion yields bounded path complexity, the consequence survives several standard graph operations.

6. Connections with asymptotic dimension and large-scale graph geometry

Asymptotic minor ideas also interact with asymptotic dimension, a large-scale invariant of metric spaces introduced by Gromov (Hickingbotham, 8 Aug 2025, Bonamy et al., 2020). One recent theorem states that every hereditary class of bounded-degree graphs that excludes some graph as a fat minor has asymptotic dimension at most $K$4, and if the excluded graph is planar then the bound improves to at most $K$5 (Hickingbotham, 8 Aug 2025). The same paper describes these bounds as best possible (Hickingbotham, 8 Aug 2025).

The mechanism behind this theorem is not an asymptotic-minor theorem per se, but it is closely aligned conceptually. The key intermediate notion is bounded Baker-treewidth, meaning that every graph in the class admits a layering such that the subgraph induced by any $K$6 consecutive layers has treewidth bounded by a function of $K$7 (Hickingbotham, 8 Aug 2025). The proof reduces fat-minor exclusion to induced-minor exclusion in hereditary classes, then shows that high Baker-treewidth would force a large induced minor via induced grids, “jump-grids,” and induced Menger/Gallai-path methods (Hickingbotham, 8 Aug 2025). Since treewidth-bounded pieces have asymptotic dimension at most $K$8, the layerability theorem yields asymptotic dimension at most $K$9 (Hickingbotham, 8 Aug 2025).

This places asymptotic-minor-type exclusion in the broader program of controlling large-scale dimension by ruling out coarse obstructions. Related results show that every proper minor-closed family has asymptotic dimension at most $K\ge 1$^^^^3all:\3^^^^ (Bonamy et al., 2020), and every proper minor-closed class has Assouad–Nagata dimension $K\ge 1$^^^^3 OR ti:\3^^^^, dropping to $K\ge 1$^^^^3 OR abs:\3^^^^ exactly when treewidth is bounded (&&&4^^^^3 OR ti:\3^^^^&&&). Those theorems concern ordinary minor exclusion rather than asymptotic minors, but they indicate the dimensional role of grid-like structures. A plausible implication is that asymptotic minors supply the appropriate obstructions when one wishes to characterize large-scale geometry more finely than ordinary minor theory permits.

7. Conceptual scope, examples, and limitations

The asymptotic-minor relation is part of a shift from local structure theory to coarse structure theory. It generalizes ordinary minors by asking whether a fixed finite graph can be modeled at every separation scale (&&&^^^^3all:\3^^^^&&&). In this sense, asymptotic minors are scale-robust obstructions: ordinary minor containment may be destroyed by demanding large separation between non-incident pieces, whereas asymptotic minor containment requires such models uniformly across all scales.

Several examples in the literature clarify what the notion does and does not capture. Graphs quasi-isometric to a cactus are characterized by $K\ge 1$3- or $K\ge 1$4-asymptotic minor exclusion (&&&^^^^3all:\3^^^^&&&). Monoholed graphs fall inside the $K\ge 1$5-asymptotic minor-free world (&&&^^^^3all:\3^^^^&&&). Yet $K\ge 1$6-minor-free graphs still have unbounded strong isometric path complexity because they contain large grids (&&&^^^^3all:\3^^^^&&&). This shows that asymptotic minor exclusion can separate graph classes that ordinary minor theory groups together.

There are also stated limitations. The paper on strong isometric path complexity records that a general conjecture asserting

$K\ge 1$7

was recently refuted (&&&^^^^3all:\3^^^^&&&). Thus asymptotic minor-freeness is not, in general, equivalent to coarse proximity to an ordinary minor-closed class. This is an important corrective to a possible misconception: asymptotic minors are not merely “minors up to quasi-isometry.”

Open directions explicitly raised in the literature include finding a clean structural characterization of graphs of bounded strong isometric path complexity, identifying minimal forbidden asymptotic minors for boundedness of that parameter, and understanding for which small graphs $K\ge 1$8 asymptotic minor exclusion still implies quasi-isometric proximity to $K\ge 1$9-minor-free classes (&&&^^^^3all:\3^^^^&&&). The available results suggest that asymptotic minors sit at an intersection of structural graph theory, metric graph theory, and coarse geometry, with grids, cacti, and $H$^^^^3all:\3^^^^-type graphs acting as central test objects (Albrechtsen et al., 2024, &&&^^^^3all:\3^^^^&&&).