1 paper
Peter J. Cameron, Michael Kagan
We consider all spanning trees of a complete simple graph Γ on n vertices that contain a given m−forest F. We show that the number of such spanning trees, τ(F), doesn't d…