Answers are grounded in this paper and cite their sources.
We prove that, for an undirected graph with n vertices and m edges, each labeled with a linear function of a parameter λ λ , the number of different minimum spanning trees obtained as the parameter varies can be Ω (mlog n) Ω ( m log n ) .
No takes yet. Share an insight, caveat, or question.
David Eppstein (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: