A lower bound on solutions of Chartrand's problem (Q1065813)

Let G be a connected graph with circuit rank \(\rho\). The author proves that if G contains spanning trees with m and n end-vertices, respectively, with \(m<n\), then G contains at least \(\rho\) spanning trees with k end-vertices for every integer k with \(m<k<n\).