Here’s a nice exercise: find the number of spanning trees of the complete bipartite graph . We have given analytic, combinatorial, and algebraic proofs of the fact that there are trees on , you may try to test all methods on this problem.

### Like this:

Like Loading...

*Related*

## Recent Comments