KöMaL 2020 A782
Prove that the edges of a simple planar graph can always be oriented such that the outdegree of all vertices is at most three.
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.