- #1

cxc001

- 16

- 0

Let G be a simple graph with min. degree k, where k>=2. Prove that G contains a cycle of length at least k+1.

Am I suppose to use induction to prove G has a path length at least k first, then try to prove that G has a cycle of length at least k+1? Or should I go directly use induction to prove G contains a cycle of length at least k+1?