Example

Consider the permutation group G = < a, b> where a = (1,2)(3,4) and b = (1,3)(2,4).

The following graph describes the action of both a and b fully.

A Schreier tree with root 1 results from deletion of any one of the four edges.