Fat Minor Conjecture in Coarse Graph Theory

• Fat Minor Conjecture is a hypothesis in coarse graph theory that characterizes large-scale structures using K-fat minor models with explicit separation criteria.
• It establishes positive cases with explicit bounds for families such as trees and K_{2,t}, employing layered decompositions and quasi-isometric techniques.
• Counterexamples and weakened conditions reveal limits in compressibility, prompting further study in geometric group theory and algorithmic graph embedding.

The Fat Minor Conjecture is a central hypothesis in coarse graph theory, formulated to characterize large-scale graph structure through minor embeddings with explicit separation parameters. Its focus is on coarse geometric analogues for classical minor exclusion, relating graph families under quasi-isometry to the absence of "fat" minor models of prescribed patterns. The conjecture has influenced developments in geometric group theory, coarse metric embedding, and the theory of graph minors, generating extensive research around its validation, counterexamples, and structural consequences.

1. Definitions and Formal Statement

A $K$-fat minor model of a finite graph $J$ in a graph $G$ comprises:

• Disjoint, connected branch-sets $U_x\subseteq V(G)$ for each $x\in V(J)$,
• Internally disjoint branch-paths $E_{xy}$ joining $U_x$ to $U_y$ for each edge $xy\in E(J)$, avoiding all other branch-sets.

The model is $K$-fat if, except for incidences between an $E_{xy}$ and its endpoints $U_x$, $U_y$, every pair among $\{U_x:x\}$ and $\{E_{xy}:xy\}$ is separated by at least distance $K$: $\operatorname{dist}_G(Y,Z)\ge K\,.$ A graph $J$ is an asymptotic minor of $G$ if it admits $K$-fat minor models for all $K\in\mathbb{N}$.

A map $\varphi:V(G)\to V(H)$ is an $(M,A)$-quasi-isometry when:

• $$M^{-1}d_G(u,v)-A\le d_H(\varphi(u),\varphi(v))\le M d_G(u,v)+A$$ for all $u,v$,
• Every $w\in V(H)$ is within $A$ of some image $\varphi(v)$.

Fat Minor Conjecture (Georgakopoulos–Papasoglu):

For every finite graph $J$ and every $K\in\mathbb{N}$, there exist constants $M,A$ such that every graph $G$ excluding $J$ as a $K$-fat minor is $(M,A)$-quasi-isometric to some graph $H$ excluding $J$ as an ordinary minor (Albrechtsen et al., 9 Jan 2026).

2. Positive Cases and Main Structural Theorems

Several graph patterns admit the Fat Minor Conjecture, validated by explicit constructive proofs:

• For all trees $J$, the conjecture is resolved affirmatively: Exclusion of $J$ as a $c$-fat minor implies $(L,C)$-quasi-isometry to a graph of bounded line-width $k$ (Nguyen et al., 10 Sep 2025).
• For complete bipartite graphs $K_{2,t}$, every graph with no $K$-fat $K_{2,t}$ minor is $(M,A)$-quasi-isometric to a $K_{2,t}$-minor-free graph, with explicit bounds $M(K,t)=9 t^{12}K+204 t^9K$, $A(K,t)=1$ (Albrechtsen et al., 16 Oct 2025).
• For 4-vertex patterns: graphs excluding $K$-fat $K_4$ minors are quasi-isometric to $K_4$-minor-free graphs, with $M(K)=50470K+142$ and $A(K)=3(M(K))^2$ (Albrechtsen et al., 2024).
• For $K_4^-$, cactus graphs arise as the minor-free classes, again with explicit distortion bounds.

These results rely on layered decompositions with controlled bag diameters and recursive "merging" or "radial decomposition" arguments. For trees, the structure parallels the classical path-width theory, but with "line-width" as the controlling parameter in coarse settings.

3. Counterexamples and Incompressible Graphs

Despite positive cases, the conjecture fails for various critical patterns:

• Davies, Hickingbotham, Illingworth, McCarty (Davies et al., 2024) constructed large graphs $G_q$ forbidding $3$-fat minors for $H$, such that any $q$-quasi-isometry $G_q\to H'$ forces a $2$-fat $H$ minor in $H'$. Thus, no uniform thinning from fat minors to ordinary minors under coarse embeddings exists in general.
• The minimal incompressible graphs include $K_{2,2,2}$ (the octahedron), all $K_t$ for $t\geq6$, and $K_{s,t}$ for $s,t\geq4$ (Albrechtsen et al., 9 Jan 2026). In these cases, the coarse self-similarity of Nguyen–Scott–Seymour (NSS) graphs ensures the persistence of ordinary minors under coarse embeddings.
• The coarse grid theorem is refuted: one can construct graphs not admitting any $3$-fat $(154\times 154)$-grid minor, yet not quasi-isometric to any graph of bounded tree-width—contradicting the expected coarse analogue of the classical grid minor theorem (Albrechtsen et al., 21 Aug 2025).

Thus, the landscape of "compressible" vs. "incompressible" patterns is sharply divided by explicit, small counterexamples.

4. Weakenings and Power-Graph Reduction

The strongest possible general weakening is established:

• If a graph excludes $K$-fat minors for a family $\mathcal{H}$, then its $K$-power graph $G^K$ (edges between pairs $\le K$ apart) excludes all $3$-fat $\mathcal{H}$ minors, and the identity map is a $K$-quasi-isometry (Davies et al., 2024, Albrechtsen et al., 9 Jan 2026).
• It is not possible to reduce to $2$-fat minors or to ordinary minors for most incompressible graphs. The "loss" from $K$ to $3$ is optimal.

A plausible implication is the existence of a canonical "fatness threshold" dictating coarse minor persistence, with $K=3$ as the universal lower bound for fat-minor exclusion under quasi-isometry.

5. Geometric Group Theory, Cayley Graphs, and Planarity

In geometric group theory, the Fat Minor Conjecture has direct implications for Cayley graphs:

• A finitely presented group $G$ is asymptotically minor-excluded if and only if it admits a planar Cayley graph up to finite-index subgroup; i.e., virtual planarity coincides with coarse minor-exclusion (MacManus, 2024). This resolves Conjecture 9.3 of Georgakopoulos–Papasoglu for finitely presented groups.
• The equivalence: $$G \text{ is asymptotically minor-excluded} \,\,\Longleftrightarrow\,\, \exists\, G'\leq G \text{ of index } <\infty \text{ with Cay}(G',S') \text{ planar}.$$ A trichotomy in the proof—covering chains of one-ended subgroups, surface subgroups, and non-surface groups—constructs arbitrarily large fat minors in non-planar cases.

6. Algorithmic Applications and Embedding Distortion

Results for $K_{2,t}$ minors yield the first polynomial-time, constant-factor approximation for embedding distortion into $K_{2,t}$-minor-free graphs:

• Given $G$, the algorithm either finds a $K$-fat $K_{2,t}$ minor or constructs a minor-free $H$ with an $O(t^{12}K)$-distortion embedding (Albrechtsen et al., 16 Oct 2025).

This suggests metric embedding and distortion estimation for large-scale sparse graph classes can be resolved efficiently for those patterns satisfying the Fat Minor Conjecture.

7. Open Problems and Future Directions

Critical open cases include:

• $K_5$ and $K_{3,t}$ for $t\ge3$, which remain ambiguous regarding compressibility.
• Possible universality of NSS graphs as canonical obstructions to compressibility.
• Coarse grid/minor theorems for induced minors or 2-fat minors in bounded-degree graphs.
• Coarse Kuratowski-type characterizations and the search for refined connectivity obstructions combining quasi-isometry invariants and large-scale separation.

The research body suggests a nuanced coarse structure theory, with explicit fatness parameters and connectivity obstructions replacing the classical minor-exclusion dichotomy for explaining large-scale graph geometry.

---

Table: Summary of Fat Minor Conjecture Results

Pattern/Class	Status	Reference
Trees	Holds, explicit bounds	(Nguyen et al., 10 Sep 2025)
$K_{2,t}$	Holds, explicit bounds	(Albrechtsen et al., 16 Oct 2025)
$K_4$, $K_4^-$	Holds, explicit bounds	(Albrechtsen et al., 2024)
$K_{2,2,2}$, $K_t$, $t\geq6$	Fails	(Albrechtsen et al., 9 Jan 2026)
Large grids	Fails	(Albrechtsen et al., 21 Aug 2025)
General graphs	Fails, weak form at $K=3$	(Davies et al., 2024)