Let $G$ be a graph. Let $k$ be the minimal degree of $G$. Show that $G$ contains a cycle of length $k + 1$.
Let $G$ be a graph of minimum degree $k>1$. Show that $G$ has a cycle of length at least $k+1$