I was reading "Graph Theory" by Diestel and I tried to solve a problem from the chapter 3 (on connectivity). It seems at first sight easy (and really intuitive) but I have to admit that I can't work it out! Here is the problem: prove that every $k$-connected graph of order at least $2k$ contains a cycle of length at least $2k$.
Does anyone have a suggestion?