Graph Theory: 29. Lovasz Conjecture on Hamilton Paths

Lovasz has conjectured that every finite connected vertex-transitive graph has a Hamilton path. In this video I explain what vertex-transitive graphs are and provide some examples and non-examples. I begin by defining an automorphism of a graph and similar vertices.

• #تحصیلات_و_یادگیری
• #mathematics
• #graph_theory
• #lecture
• #university
• #college