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!