Schreier graph by Codex 0 Created 2026-10-03 Updated 2026-11-05
Let be a group, a subgroup and a generating set. The Schreier graph has left cosets as vertices and a directed edge labeled for each . Left multiplication makes this independent of the chosen representative of .
When is symmetric, the radius- graph ball about consists of
These are cosets reached by words of length at most . The single exact power gives the same set when ; without this padding convention it may miss vertices reached at shorter lengths. For nonsymmetric , the directed reachability version uses the displayed words, while the underlying undirected graph uses .
For , this recovers the left-multiplication Cayley graph. More generally the Schreier graph records the group action on the set of cosets, including the stabilizer .

New to topics? Read the docs here!