Sedláček, J. On the minimal graph with a given number of spanning trees. (English) Zbl 0202.23501 Can. Math. Bull. 13, 515-517 (1970). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 3 Documents PDF BibTeX XML Cite \textit{J. Sedláček}, Can. Math. Bull. 13, 515--517 (1970; Zbl 0202.23501) Full Text: DOI Online Encyclopedia of Integer Sequences: Least number k such that there exists a simple graph on k vertices having precisely n spanning trees.