SCHWEITZER 1959 Problem 10

Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) (C. 5)