MathDB
convex polygon is divided into some triangles, set of vertices and edges

Source: 2017 Saudi Arabia IMO Training Test p6

September 4, 2020
combinatorial geometrycombinatoricsconvex

Problem Statement

A convex polygon is divided into some triangles. Let VV and EE be respectively the set of vertices and the set of egdes of all triangles (each vertex in VV may be some vertex of the polygon or some point inside the polygon). The polygon is said to be good if the following conditions hold: i. There are no 33 vertices in VV which are collinear. ii. Each vertex in VV belongs to an even number of edges in EE. Find all good polygon.