-1
$\begingroup$

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.

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

$\endgroup$
3
$\begingroup$

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}$.

$\endgroup$
  • $\begingroup$ A minor nitpick, but $K_{m,m+1}$ does have a Hamiltonian path. $\endgroup$ – Gordon Royle Apr 5 '17 at 12:27
  • $\begingroup$ Ah, path. I thought about cycle. $\endgroup$ – Fedor Petrov Apr 5 '17 at 12:55

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.