Question

Prove that any graph of minimum degree at least three contains a cycle of even length.

Answer 1

a cycle is a sequence of non-repeated vertices and the degree of a graph is the number of neighbors the vertex has.