KöMaL 2009 A471
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.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.