Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

Let $α(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $β(n)$ as the least number $k$ for which there exists a simple graph with $k$ edges having precisely $n \geq 3$ spanning trees. As an $n$-cycle has exactly $n$ spanning trees, it follows that $α(n),β(n) \leq n$. In this paper, we show that $α(n) \leq \frac{n+4}{3}$ and $β(n) \leq \frac{n+7}{3}$ if and only if $n \notin {3,4,5,6,7,9,10,13,18,22}$, which is a subset of Euler's idoneal numbers. Moreover, if $n \not \equiv 2 \pmod{3}$ and $n \not = 25$ we show that $α(n) \leq \frac{n+9}{4}$ and $β(n) \leq \frac{n+13}{4}.$ This improves some previously known bounds.

No reviews yet.

No comments yet.