Ends of Schreier graphs of hyperbolic groups
classification
🧮 math.GR
keywords
endshyperbolicschreieralgorithmgraphgroupnumbersubgroup
read the original 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 quasi-convex subgroup of G, we construct an algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.