6.4.20 Graph theory

Problem: Prove that any \( k \)-connected graph \( G \), built on \( n \geq 2 \) vertices, \( k \geq 2 \), contains a cycle \( C \), length of which is greater than or equal to \( 2 k \).