in this talk we will explore one useful connection between graphs and permutation groups. with a little help from a. cayley we'll see how many spanning trees a graph with n vertices has. then we'll use this to find the number of minimal-length factorizations of a permutation into transpositions. the material should be accessible to anyone with a rudimentary knowledge of group theory. undergraduates welcome!