coloring vertices of convex n-gon
Source: 1978 Hungary - Kürschák Competition p2
October 15, 2022
Coloringcombinatoricscombinatorial geometry
Problem Statement
The vertices of a convex -gon are colored so that adjacent vertices have different colors. Prove that if is odd, then the polygon can be divided into triangles with non-intersecting diagonals such that no diagonal has its endpoints the same color.