KöMaL 2017 B4899
The degree of each vertex of a simple planar graph is 3, and can be drawn in the plane with its edges represented by non-intersecting unit line segments. Show that has at least vertices.
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.