This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 2685 of 3,121·53. Graph TheoryPro lesson
Dirac's Theorem
If every vertex in a graph on n ≥ 3 vertices has degree ≥ n/2, then the graph is Hamiltonian.