A huge sheet of paper lies on the table. A cartographer tries to fit all conceivable landscapes onto it: mountain ranges, tangled gorges, endless plains. Each landscape is a finitely generated group, and the map is its Cayley graph, a graphic portrait of the group, where vertices are elements and edges are connections between them. Distortions are allowed: distances can be stretched and squeezed, but no more than a fixed number of times — such a mapping is called a coarse embedding, as if we looked at the landscape through foggy glass. Can there exist a universal map onto which all groups fit up to such blurry outlines? Mathematician Robin Tucker-Drob answered bluntly: no.

The key to the proof is a clash of two numbers. The cartographer draws on graph paper and can only draw lines with a certain precision. If all landscapes could fit onto such a map, then there would exist regular maps — L-Lipschitz maps with bounded fiber, meaning that no more than M points of the landscape get glued into one point of the map. Then the number of distinct map-images for a group of s elements is bounded above by an exponential: N(s) ≤ $A^s$, where A depends on the allowed distortions. But the number of possible landscapes — 3-regular graphs with large girth (girth is the length of the shortest cycle, like a trail that doesn’t return too soon) — grows super-exponentially: M(s) ≥ (a s)^{3s/2}. For large s, the super-exponential outruns the exponential. An obstruction is inevitable.

But a single scattered obstruction is not enough — one must show that even one group can be a universal exception. Here graphical small cancellation enters — a method of labeling edges with symbols from a finite alphabet, a kind of code labeling that ensures long paths do not repeat. It’s like assembling a giant puzzle, where each piece carries only a small fraction of the whole picture, but together they form a group K. Its Cayley graph isometrically contains all the obstruction landscapes — exactly, without distortion. Hence, group K cannot be coarsely embedded into any map with finitely many typical sheets.

The result dashes the hope for a unified coarse classification of all groups and forces us to study each landscape individually. The sheet of paper on the cartographer's desk will always be incomplete: some terrain will inevitably fall beyond its edges. Looking ahead — the search for quantitative strengthenings: how fast must parameters grow for an obstruction to emerge, and can the conditions be weakened to just bounded degree of the graph? The technique itself, combining graph counting and small cancellation, provides a powerful tool for constructing exotic spaces in geometry and dynamical systems theory.