Schreier coset graph

In the area of mathematics called combinatorial group theory, the Schreier coset graph is a graph associated with a group G, a generating set S={si : i in I} of G, and a subgroup H ≤ G. The Schreier graph encodes the abstract structure of a group modulo an equivalence relation formed by the coset.

The graph is named after Otto Schreier, who used the term "Nebengruppenbild". An equivalent definition was made in an early paper of Todd and Coxeter.

Description
The Schreier graph of a group G, a subgroup H, and a generating set S⊆G is denoted by Sch(G,H,S) or Sch(H\G,S). Its vertices are the right cosets Hg = {hg : h in H} for g in G, and its edges are of the form (Hg, Hgs) for g in G and s in S.

More generally, if X is a G-set, the Schreier graph of the action of G on X (with respect to S⊆G) is denoted by Sch(G,X,S) or Sch(X,S). Its vertices are the elements of X, and its edges are of the form (x,xs) for x in X and s in S. This includes the original Schreier coset graph definition, as H\G is a naturally a G-set with respect to multiplication from the right. From an algebraic-topological perspective, the graph Sch(X,S) has no distinguished vertex, whereas Sch(G,H,S) has the distinguished vertex H, and is thus a pointed graph.

The Cayley graph of the group G itself is the Schreier coset graph for H = {1G}.

A spanning tree of a Schreier coset graph corresponds to a Schreier transversal, as in Schreier's subgroup lemma.

The book "Categories and Groupoids" listed below relates this to the theory of covering morphisms of groupoids. A subgroup H of a group G determines a covering morphism of groupoids $$ p: K \rightarrow G $$ and if S is a generating set for G then its inverse image under p is the Schreier graph of (G, S).

Applications
The graph is useful to understand coset enumeration and the Todd–Coxeter algorithm.

Coset graphs can be used to form large permutation representations of groups and were used by Graham Higman to show that the alternating groups of large enough degree are Hurwitz groups,.

Stallings' core graphs are retracts of Schreier graphs of free groups, and are an essential tool for computing with subgroups of a free group.

Every vertex-transitive graph is a coset graph.