# Spanning trees of K_{m,n}

Here’s a nice exercise: find the number of spanning trees of the complete bipartite graph $K_{m,n}$. We have given analytic, combinatorial, and algebraic proofs of the fact that there are $n^{n-2}$ trees on $[n]$, you may try to test all methods on this problem.