Problem

Source: 2009 HongKong mathematical Olympiad

Tags: combinatorics proposed, combinatorics



there are $n$ points on the plane,any two vertex are connected by an edge of red,yellow or green,and any triangle with vertex in the graph contains exactly $2$ colours.prove that $n<13$