On a question of Erdős and Nešetřil about minimal cuts in a graph

Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most ${1.8899}^n$ for large enough $n$.