Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?

Problem B. 4725. (September 2015)

B. 4725. Show that if a simple graph has 7 vertices and no cycle of length 4 then it has a vertex whose degree is at most 2.

(4 pont)

Deadline expired on October 12, 2015.


158 students sent a solution.
4 points:119 students.
3 points:15 students.
2 points:8 students.
1 point:12 students.
0 point:3 students.
Unfair, not evaluated:1 solutions.

Problems in Mathematics of KöMaL, September 2015