1. The problem statement, all variables and given/known data Let G be a graph. 1. Let n be a natural number. Use induction to show for all n >= 2 Kn has a Hamiltonian path. 2. Explain how you could use the proof from #1 to show that for all n (natural number) n > 2 Kn has a Hamiltonian cycle. 2. Relevant equations 3. The attempt at a solution So Kn refers to a complete graph - I know that much. And the n refers to the number of vertices. I'm not sure how to begin the proof for #1. For #2, the subgraph excluding one vertex is Kn-1 has a path. We can connect the ends together through the excluded vertex to make a cycle.