SearcharxivSearch

arXiv · 2511.10759

Vertex-transitive graphs with uniformly bisecting quasi-geodesics

Abstract

Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is quasi-isometric to either the Euclidean plane or the hyperbolic plane. In particular, if $X$ is a Cayley graph of a finitely generated group $G$ with the above property, then $G$ is a virtual surface group. This can be interpreted as an extension of the well-known fact that a hyperbolic group with circular boundary is virtually Fuchsian. Our theorem positively resolves Problem 14.98 of the Kourovka Notebook, posed by V. A. Churkin in 1999. The proof uses an isoperimetric inequality of Coulhon--Saloff-Coste to show that if such a graph has the above property, then either it is hyperbolic or has quadratic growth.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph Paul MacManus. 2025-11-13. Vertex-transitive graphs with uniformly bisecting quasi-geodesics. https://arxiv.org/abs/2511.10759

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR