Schreier graphs: transitivity and coverings
Combinatorics
2025-04-02 v1 Group Theory
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.
Cite
@article{arxiv.1505.03433,
title = {Schreier graphs: transitivity and coverings},
author = {Paul-Henry Leemann},
journal= {arXiv preprint arXiv:1505.03433},
year = {2025}
}
Comments
24 pages, 6 figures