two colours in the vertices of a nonagon
Source: Tuymaada 1996 p3
April 27, 2019
combinatoricscombinatorial geometryColoringRamsey Theory
Problem Statement
Nine points of the plane, located at the vertices of a regular nonagon, are pairwise connected by segments, each of which is colored either red or blue. It is known that in any triangle with vertices at the vertices of the nonagon at least one side is red. Prove that there are four points, any two of which are connected by red lines.