Open Access
2018 Ends of Schreier graphs of hyperbolic groups
Audrey Vonseel
Algebr. Geom. Topol. 18(5): 3089-3118 (2018). DOI: 10.2140/agt.2018.18.3089

Abstract

We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G . In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair ( G , H ) . However, assuming that H is a quasiconvex subgroup of G , we construct an algorithm.

Citation

Download Citation

Audrey Vonseel. "Ends of Schreier graphs of hyperbolic groups." Algebr. Geom. Topol. 18 (5) 3089 - 3118, 2018. https://doi.org/10.2140/agt.2018.18.3089

Information

Received: 14 February 2018; Revised: 11 June 2018; Accepted: 21 June 2018; Published: 2018
First available in Project Euclid: 30 August 2018

zbMATH: 06935830
MathSciNet: MR3848409
Digital Object Identifier: 10.2140/agt.2018.18.3089

Subjects:
Primary: 20F65
Secondary: 20F10

Keywords: Bestvina–Mess condition , hyperbolic groups , relative ends , Schreier graphs

Rights: Copyright © 2018 Mathematical Sciences Publishers

Vol.18 • No. 5 • 2018
MSP
Back to Top