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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: