Schreier graphs: transitivity and coverings

Abstract

We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow's rigidity theorem for hyperbolic manifolds. This allows us to give a transitivity criterion for Schreier graphs. Finally, we show that Tarski monsters satisfy a strong simplicity criterion.

24 pages, 6 figures

Cited by in corpus (2)

• Cayley graphs with few automorphisms
• Furstenberg Entropy of Intersectional Invariant Random Subgroups