Let δ ≥ 2. Prove that every simple graph G satisfying δmin(G) ≥
containing no triangles contains a cycle of length at least 2δ.
Prove that this result is sharp by showing that we cannot guarantee the existence of
a cycle of length at least 2δ + 1. Give a counterexample for each δ.
Get Answers For Free
Most questions answered within 1 hours.