Schreier coset graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In the area of mathematics called combinatorial group theory, the Schreier coset graph is a graph associated to a group G, a generating set { xi : i in I }, and a subgroup HG.


Description[edit]

The vertices of the graph are the right cosets Hg = { hg : h in H } for g in G.

The edges of the graph are of the form (Hg,Hgxi).

The Cayley graph of the group G with { xi : i in I } is the Schreier coset graph for H = { 1G },(Gross & Tucker 1987, p. 73).

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

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 X is a generating set for G then its inverse image under p is the Schreier graph of (G,X).

Name[edit]

The graph is named after Otto Schreier.

Applications[edit]

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, (Conder 2003).

Every vertex-transitive graph is a coset graph.

References[edit]