KöMaL 2019 K615
Six points are selected in the interior of a square such that no three points among the 10 points (the vertices of the square and the six points) are collinear. From these 10 points, pairs of points are connected with line segments that do not intersect each other, and the process is continued until it is not possible to add a further line segment. What is the largest possible number of line segments that may be drawn in this way?
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.