KöMaL 2015 B4725
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.
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.