Nebesky, Ladislav On the minimum number of vertices and edges in a graph with a given number of spanning trees. (English) Zbl 0251.05120 Čas. Pěst. Mat. 98, 95-97 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 05C05 Trees 05C35 Extremal problems in graph theory PDF BibTeX XML Cite \textit{L. Nebesky}, Čas. Pěstování Mat. 98, 95--97 (1973; Zbl 0251.05120) Full Text: EuDML Online Encyclopedia of Integer Sequences: Least number k such that there exists a simple graph on k vertices having precisely n spanning trees.