Cycles in graphs
Source: Iran pre-preparation course examination 2011- P5
February 25, 2011
combinatorics proposedcombinatorics
Problem Statement
a) Prove that if is -connected, then it has a cycle with the length at least . (10 points)b) Prove that every -regular graph with vertices has a hamiltonian cycle. (10 points)