MathDB
Miklós Schweitzer 1959- Problem 10

Source:

November 8, 2015
college contests

Problem Statement

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