Long path from minimum degree
= Long path from minimum degree
Every connected $n$-vertex graph of minimum degree $\delta$ contains a path of length at least $\min(2\delta,n-1)$.
= Long path from minimum degree
Every connected $n$-vertex graph of minimum degree $\delta$ contains a path of length at least $\min(2\delta,n-1)$.