Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/ii/paper-4/17j/b/solution

Deleting vertices from a Hamilton cycle leaves at most path components, so the property is necessary. It is not sufficient: the Petersen graph is 1-tough, meaning for every separating set , but it is not Hamiltonian.

New to topics? Read the docs here!