MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
1959 Miklós Schweitzer
10
10
Part of
1959 Miklós Schweitzer
Problems
(1)
Miklós Schweitzer 1959- Problem 10
Source:
11/8/2015
10. Prove that if a graph with
2
n
+
1
2n+1
2
n
+
1
vertices has at least
3
n
+
1
3n+1
3
n
+
1
edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for
3
n
3n
3
n
edges. (By a circuit, we mean a closed line which does not intersect itself.) (C. 5)
college contests