Is there for every positive integer $n\in\mathbb{N}$ a finite, simple, undirected graph $G=(V,E)$ with $n=\lvert V\rvert$ and the following property?

$G$ does not have a complete minor with more than $\frac{\delta(G)}{n}$ points (where $\delta(G)$ denotes the minimal degree).