If the symmetric group is generated by transpositions corresponding to the
edges of a spanning tree we discuss identities they satisfy, including a se
t of defining relations. We further show that a minimal length factorizatio
n of a permutation fixing a terminal vertex does not involve the unique edg
e incident to that vertex. (C) 1999 Academic Press.