Abstract
Let (Xn) be an unbounded sequence of finite, connected, vertex transitive graphs such that |Xn|=O(diam(Xn)q) for some q>0. We show that up to taking a subsequence, and after rescaling by the diameter, the sequence (Xn) converges in the Gromov Hausdorff distance to some finite dimensional torus equipped with some invariant Finsler metric. The proof relies on a recent quantitative version of Gromov’s theorem on groups with polynomial growth obtained by Breuillard, Green and Tao. If Xn is only roughly transitive and |Xn|=O diam(Xn δ) for δ >1 sufficiently small, we prove, this time by elementary means, that (Xn) converges to a circle.
| Original language | English |
|---|---|
| Pages (from-to) | 333-374 |
| Number of pages | 42 |
| Journal | Combinatorica |
| Volume | 37 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jun 2017 |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Discrete Mathematics and Combinatorics