2001 BAMO p1 each vertex of regular 17-gon colored red, blue, green
Source:
August 26, 2019
combinatoricscombinatorial geometryColoring
Problem Statement
Each vertex of a regular -gon is colored red, blue, or green in such a way that no two adjacent vertices have the same color. Call a triangle “multicolored” if its vertices are colored red, blue, and green, in some order. Prove that the -gon can be cut along nonintersecting diagonals to form at least two multicolored triangles.
(A diagonal of a polygon is a a line segment connecting two nonadjacent vertices. Diagonals are called nonintersecting if each pair of them either intersect in a vertex or do not intersect at all.)