MathDB
Triangulation of a graph

Source: China Team Selection Test 2016 Test 3 Day 2 Q5

March 26, 2016
combinatoricsgraph theorycombinatorial geometry

Problem Statement

Let SS be a finite set of points on a plane, where no three points are collinear, and the convex hull of SS, Ω\Omega, is a 20162016-gon A1A2A2016A_1A_2\ldots A_{2016}. Every point on SS is labelled one of the four numbers ±1,±2\pm 1,\pm 2, such that for i=1,2,,1008,i=1,2,\ldots , 1008, the numbers labelled on points AiA_i and Ai+1008A_{i+1008} are the negative of each other. Draw triangles whose vertices are in SS, such that any two triangles do not have any common interior points, and the union of these triangles is Ω\Omega. Prove that there must exist a triangle, where the numbers labelled on some two of its vertices are the negative of each other.