A minimal cut of a graph is a minimal set of vertices whose removal disconnects the graph. Let $c(n)$ be the maximum number of minimal cuts a graph on $n$ vertices can have.

The current best-known bounds on $\alpha$ are $$1.4457\leq \alpha \leq \frac{1+\sqrt{5}}{2}\approx 1.618.$$ The lower bound is due to Gaspers and Mackenzie [GaMa18].