For a finite, simple undirected graph $G=(V,E)$ let $\delta(G)$ denote the minimum degree of all vertices. For any integer $k\geq 4$ let $N(k)$ denote the maximum $\delta(G)$ that a connected graph $G$ on $k$ vertices can have such that $G$ does **not** have a [Hamiltonian path](https://en.wikipedia.org/wiki/Hamiltonian_path). 


Do we have $\lim \sup\_{k\to \infty} \frac{N(k)}{k} = 1$?



Maximum minimal degree $\delta(G)$ for connected, non-Hamiltonian $G$
No, a graph with $\delta(G)\geqslant (k-1)/2$ has Hamiltonian path by Dirac's theorem. But for $\delta(G)=(k-2)/2$ this is already not always so, see $K\_{m,m+2}$.


