Problem

Source: 1998 France MO P5

Tags: geometry, combinatorics



Let $A$ be a set of $n\ge3$ points in the plane, no three of which are collinear. Show that there is a set $S$ of $2n-5$ points in the plane such that, for each triangle with vertices in $A$, there exists a point in $S$ which is strictly inside that triangle.