TR-MO 2015 Problem 3
points are given on a plane where . All pairs of points are connected with a segment. Find the maximal number of segments which don't intersect with any other segments in their interior.
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.