In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let be the bipartition of the complete bipartite graph with and . We prove that for any given spanning forest of with components , the number of spanning trees in which contain all edges in is equal to where and for .
No takes yet. Share an insight, caveat, or question.
Dong et al. (2022) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: