KöMaL 2018 B4938
It is known that it is possible to draw the complete graph with vertices on the surface of a torus (see the Császár polyhedron, for example). 7 points are marked on the side of a mug. We want to connect each pair of points with a curve, so that the curves have no interior points in common. What minimum number of these curves need to lead across the handle of the mug?
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.