RO-TST 2012 Problem 4
Prove that a finite simple planar graph has an orientation so that every vertex has out-degree at most 3.
Dataset text AI-MO AoPS. 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.