Schreir graphs: Transitivity and coverings
2016 ◽
Vol 26
(01)
◽
pp. 69-93
◽
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. This gives a partial answer to a question of Benjamini and Duminil-Copin.
2008 ◽
Vol 78
(1)
◽
pp. 141-146
◽
2016 ◽
Vol 161
(2)
◽
pp. 283-303
◽
1993 ◽
Vol 117
(3)
◽
pp. 789-789
◽
Keyword(s):
2018 ◽
Vol 17
(04)
◽
pp. 1850072
◽
1974 ◽
Vol 32
◽
pp. 254-255
1983 ◽
Vol 41
◽
pp. 270-271
1973 ◽
Vol 31
◽
pp. 144-145
1973 ◽
Vol 31
◽
pp. 132-133
◽