Assume that a graph G has n vertices where n is odd

(1) Assume that a graph G has n vertices, where n is odd, and it is regular of degree d (so all vertices have degree d), where d is a positive integer. Must G contain at least one cycle of odd length (an odd cycle)? Either nd such a graph with no odd cycles, or prove that G must contain an odd cycle