Problem

Source: 239 MO 2024 J2

Tags: combinatorics, combinatorial geometry



There are $2n$ points on the plane, no three of which lie on the same line. Some segments are drawn between them so that they do not intersect at internal points and any segment with ends among the given points intersects some of the drawn segments at an internal point. Is it true that it is always possible to choose $n$ drawn segments having no common ends?