4
$\begingroup$

Prove that if a graph $G$ is $k$-connected and $\alpha(G) \le k$ then $G$ is Hamiltonian. Where $\alpha(G) $ is the size of the largest independent set in $G.$

1 Answers 1