Factoring, into Edge Transpositions of a Tree, Permutations Fixing a Terminal Vertex

If the symmetric group is generated by transpositions corresponding to the edges of a spanning tree we discuss identities they satisfy, including a set of defining relations. We further show that a minimal length factorization of a permutation fixing a terminal vertex does not involve the unique edge incident to that vertex.