$G =(V,E)$ is $k$-connected ($k \geq 2$), prove that for every subset $S \subseteq V $, |S|=k there exists a cycle in $G$ that goes through all of $S$
Every $k$ vertices in an $k$ - connected graph are contained in a cycle.