pith. sign in

arxiv: 2607.00963 · v1 · pith:AV4Y6MOQnew · submitted 2026-07-01 · 🧮 math.GR · math.MG

Obstructions to coarse universality for finitely generated groups

Robin Tucker-Drob This is my paper

Pith reviewed 2026-07-02 04:03 UTC · model grok-4.3

classification 🧮 math.GR math.MG
keywords finitelygeneratedgrouplambdagraphscoarselyeverygraph
0
0 comments X

The pith

No countable family of bounded-degree graphs admitting finitely cobounded coarse quasi-actions contains every finitely generated group as a coarse embedding, resolving conjectures on the non-existence of universal Cayley graphs and quasi-isometry classes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The work shows that certain graphs cannot act as universal containers for all finitely generated groups under coarse embeddings, which roughly preserve distances up to bounded distortion. For any graph of bounded degree that admits a group quasi-action with finite coboundedness, the authors construct a finitely generated group whose geometry prevents it from embedding coarsely into that graph. They do this by first counting that only exponentially many finite graphs can map regularly into the target graph. They then contrast this with a much larger supply of high-girth cubic graphs, which serve as obstructions because their lack of short cycles cannot be accommodated. A graphical small-cancellation construction, building on prior labeling theorems, then assembles a sequence of these obstruction graphs into the Cayley graph of a single finitely generated group. The same argument scales to any countable list of target graphs, and it also rules out any locally compact second-countable group from coarsely containing all finitely generated groups. The technique therefore demonstrates structural limits on how much the coarse geometry of groups can be unified inside one ambient space.

Core claim

For every bounded-degree graph Λ admitting a finitely cobounded coarse quasi-action by a group, there is a finitely generated group which does not coarsely embed into Λ; more generally, for every countable family (Λ_i) of such graphs, there is a finitely generated group that does not coarsely embed into any Λ_i.

Load-bearing premise

That a variation of Osajda's labeling theorem (following Esperet and Giocanti) can be applied to realize an arbitrary sequence of finite high-girth 3-regular obstruction graphs isometrically inside the Cayley graph of a finitely generated group, as invoked in the final step of the argument.

read the original abstract

We prove that, for every bounded-degree graph $\Lambda$ admitting a finitely cobounded coarse quasi-action by a group, there is a finitely generated group which does not coarsely embed into $\Lambda$. More generally, for every countable family $(\Lambda_i)$ of such graphs, there is a finitely generated group that does not coarsely embed into any $\Lambda_i$. This resolves two conjectures of Simon Thomas: neither a universal Cayley graph nor a universal quasi-isometry class of finitely generated groups exists. As another consequence, we show that no locally compact second countable group coarsely contains every finitely generated group. The proof uses an exponential upper bound on the number of finite graphs admitting an $(L,M)$-regular map into $\Lambda$, together with a superexponential supply of high-girth $3$-regular graphs, yielding a sequence of finite high-girth obstruction graphs. A graphical small-cancellation labeling, using a variation of Osajda's labeling theorem following Esperet and Giocanti, then realizes this sequence isometrically inside the Cayley graph of a finitely generated group.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard set-theoretic and group-theoretic foundations together with previously published results on small-cancellation theory and graph enumeration; the abstract introduces no new free parameters, ad-hoc axioms, or postulated entities.

axioms (2)
  • standard math ZFC set theory and the basic axioms of group theory and metric geometry
    The paper works entirely within classical mathematics; these background axioms are invoked implicitly throughout.
  • domain assumption Existence of superexponentially many high-girth 3-regular graphs
    Invoked to produce the obstruction sequence; this is a known fact from graph theory but is treated as an input.

pith-pipeline@v0.9.1-grok · 5709 in / 1466 out tokens · 56284 ms · 2026-07-02T04:03:59.502968+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

18 extracted references · 14 canonical work pages · 4 internal anchors

  1. [1]

    Extension properties of asymptotic property C and finite decomposition complexity

    S. Beckhardt and B. Goldfarb,Extension properties of asymptotic property C and finite decomposition complexity, Topology Appl.239(2018), 181–190. doi: 10.1016/j.topol.2018.02.034; arXiv:1607.00445

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1016/j.topol.2018.02.034 2018

  2. [2]

    Benjamini, O

    I. Benjamini, O. Schramm, and Á. Timár,On the separation profile of infinite graphs, Groups Geom. Dyn. 6(2012), no. 4, 639–658. doi: 10.4171/GGD/168

    work page doi:10.4171/ggd/168 2012

  3. [3]

    de Cornulier and P

    Y. de Cornulier and P. de la Harpe,Metric geometry of locally compact groups, EMS Tracts in Mathematics, vol. 25, European Mathematical Society (EMS), Zürich, 2016

    2016

  4. [4]

    Esperet and U

    L. Esperet and U. Giocanti,Optimization in graphical small cancellation theory, Discrete Math.347(2024), no. 4, Paper No. 113842, 11 pp. doi: 10.1016/j.disc.2023.113842; arXiv:2306.03474

    work page doi:10.1016/j.disc.2023.113842 2024

  5. [5]

    Gromov,Random walk in random groups, Geom

    M. Gromov,Random walk in random groups, Geom. Funct. Anal.13(2003), no. 1, 73–146. doi: 10.1007/s000390300002

    work page doi:10.1007/s000390300002 2003

  6. [6]

    R. I. Grigorchuk,Degrees of growth of finitely generated groups, and the theory of invariant means, Math. USSR-Izv.25(1985), no. 2, 259–300. doi: 10.1070/IM1985v025n02ABEH001281

    work page doi:10.1070/im1985v025n02abeh001281 1985

  7. [7]

    Groups with graphical C(6) and C(7) small cancellation presentations

    D. Gruber,Groups with graphicalC(6)andC(7)small cancellation presentations, Trans. Amer. Math. Soc. 367(2015), no. 3, 2051–2078. doi: 10.1090/S0002-9947-2014-06198-9; arXiv:1210.0178

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1090/s0002-9947-2014-06198-9 2015

  8. [8]

    Proper metrics on locally compact groups, and proper affine isometric actions on Banach spaces

    U. Haagerup and A. Przybyszewska,Proper metrics on locally compact groups, and proper affine isometric actions on Banach spaces, preprint, 2006, arXiv:math/0606794. 12 ROBIN TUCKER-DROB

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  9. [9]

    K. H. Hofmann and S. A. Morris,Open mapping theorem for topological groups, Topology Proc.31(2007), no. 2, 533–551

    2007

  10. [10]

    Hume,A continuum of expanders, Fund

    D. Hume,A continuum of expanders, Fund. Math.238(2017), no. 2, 143–152. doi: 10.4064/fm101-11-2016

    work page doi:10.4064/fm101-11-2016 2017

  11. [11]

    D. Hume, J. M. Mackay, and R. Tessera,Poincaré profiles of groups and spaces, Rev. Mat. Iberoam.36 (2020), no. 6, 1835–1886. doi: 10.4171/RMI/1184

    work page doi:10.4171/rmi/1184 2020

  12. [12]

    Linial and M

    N. Linial and M. Simkin,A randomized construction of high girth regular graphs, Random Structures Algorithms58(2021), no. 2, 345–369. doi: 10.1002/rsa.20976; arXiv:1911.09640

    work page doi:10.1002/rsa.20976 2021

  13. [13]

    Ollivier,On a small cancellation theorem of Gromov, Bull

    Y. Ollivier,On a small cancellation theorem of Gromov, Bull. Belg. Math. Soc. Simon Stevin13(2006), no. 1, 75–89. doi: 10.36045/bbms/1148059334. Corrected version: arXiv:math/0310022v2

    work page doi:10.36045/bbms/1148059334 2006

  14. [14]

    Osajda,Small cancellation labellings of some infinite graphs and applications, Acta Math.225(2020), no

    D. Osajda,Small cancellation labellings of some infinite graphs and applications, Acta Math.225(2020), no. 1, 159–191. doi: 10.4310/ACTA.2020.v225.n1.a3; arXiv:1406.5015

    work page doi:10.4310/acta.2020.v225.n1.a3 2020

  15. [15]

    Papasoglu and K

    P. Papasoglu and K. Whyte,Quasi-isometries between groups with infinitely many ends, Comment. Math. Helv.77(2002), no. 1, 133–144. doi: 10.1007/S00014-002-8334-2

    work page doi:10.1007/s00014-002-8334-2 2002

  16. [16]

    Quasi-actions and rough Cayley graphs for locally compact groups

    P. Salmi,Quasi-actions and generalised Cayley–Abels graphs of locally compact groups, J. Group Theory 18(2015), no. 1, 45–60. doi: 10.1515/jgth-2014-0031; arXiv:1112.6415

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1515/jgth-2014-0031 2015

  17. [17]

    R. A. Struble,Metrics in locally compact groups, Compositio Math.28(1974), no. 3, 217–222

    1974

  18. [18]

    Thomas,On groups with isomorphic Cayley graphs, preprint,https://sites.math.rutgers.edu/ ~sthomas/More-Cayley.pdf

    S. Thomas,On groups with isomorphic Cayley graphs, preprint,https://sites.math.rutgers.edu/ ~sthomas/More-Cayley.pdf