 Solution

ID: past-exam-of-the-probability-statistics-and-options-i-course-of-the-university-of-oxford/2007/r/1/ii/solution

True. Label the vertices

1, \dots, n

. The cycle

1, 2, \dots, n, 1

uses existing edges of the complete graph and visits every vertex once before returning. It is a Hamiltonian cycle for every

n \geq 3

 New to topics? Read the docs here!