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

Problem A. 471. (January 2009)

A. 471. Prove that if each vertex of a simple graph is of degree at least 3 then the graph contains a cycle with length not divisible by 3.

Russian competition problem

(5 pont)

Deadline expired on February 16, 2009.


16 students sent a solution.
5 points:Backhausz Tibor, Blázsik Zoltán, Éles András, Grósz Dániel, Hoksza Zsolt, Mester Márton, Nagy 235 János, Nagy 314 Dániel, Nagy 648 Donát, Tomon István, Tossenberger Anna, Varga 171 László.
4 points:Bodor Bertalan.
2 points:1 student.
1 point:2 students.

Problems in Mathematics of KöMaL, January 2009