# 1992 IMO Problems/Problem 3

## Problem

Consider nine points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $n$ such that whenever exactly n edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

## Solution

We show that for $n = 32$ we can find a coloring without a monochrome triangle. Take two squares $R_1R_2R_3R_4$ and $B_1B_2B_3B_4$. Leave the diagonals of each square uncolored, color the remaining edges of $R$ red and the remaining edges of $B$ blue. Color blue all the edges from the ninth point $X$ to the red square, and red all the edges from $X$ to the blue square. Color $R_iB_j$ red if $i$ and $j$ have the same parity and blue otherwise. Clearly $X$ is not the vertex of a monochrome square, because if $XY$ and $XZ$ are the same color then, $YZ$ is either uncolored or the opposite color. There is no triangle within the red square or the blue square, and hence no monochrome triangle. It remains to consider triangles of the form $R_iR_jB_k$ and $B_iB_jR_k.$ But if $i$ and $j$ have the same parity, then $R_iR_j$ is uncolored (and similarly $B_iB_j$), whereas if they have opposite parity, then $R_iB_k$ and $R_jB_k$ have opposite colors (and similarly $B_iR_k$ and $B_jR_k$). It remains to show that for $n = 33$ we can always find a monochrome triangle. There are three uncolored edges. Take a point on each of the uncolored edges. The edges between the remaining $6$ points must all be colored. Take one of these, $X.$ At least $3$ of the $5$ edges to $X$, say $XA$, $XB$, $XC$ must be the same color (say red). If $AB$ is also red, then $XAB$ is monochrome. Similarly, for $BC$ and $CA.$ But if $AB$, $BC$ and $CA$ are all blue, then $ABC$ is monochrome.