Triangulation of a graph
Source: China Team Selection Test 2016 Test 3 Day 2 Q5
March 26, 2016
combinatoricsgraph theorycombinatorial geometry
Problem Statement
Let be a finite set of points on a plane, where no three points are collinear, and the convex hull of , , is a gon . Every point on is labelled one of the four numbers , such that for the numbers labelled on points and are the negative of each other.
Draw triangles whose vertices are in , such that any two triangles do not have any common interior points, and the union of these triangles is . Prove that there must exist a triangle, where the numbers labelled on some two of its vertices are the negative of each other.