convex N-gon
Source: Tournament of Towns, Fall 2002, Junior A Level, P5
May 17, 2014
combinatorics proposedcombinatorics
Problem Statement
A convex is divided by diagonals into triangles so that no two diagonals intersect inside the polygon. The triangles are painted in black and white so that any two triangles are painted in black and white so that any two triangles with a common side are painted in different colors. For each find the maximal difference between the numbers of black and white triangles.