Maths Olympiad Prep

Library / NMO Selection Tests for the Junior Balkan Mathematical Olympiad /23 of 62

NMO Selection Tests for the Junior Balkan Mathematical Olympiad

Combinatorics Difficulty 5.5 AIME, harder Prove it Romania

Find the smallest positive integer nn for which, no matter how we choose to color red nn vertices of a cube, there is a vertex of the cube whose three adjacent vertices are all colored red.

Solution

Let ABCDA′B′C′D′ABCD A'B'C'D' be a cube. Coloring red the four vertices of a face (e.g. A,B,C,DA, B, C, D), no vertex of the cube has all three adjacent vertices colored red, so n≥5n \ge 5.

Now, let us color 5 vertices of the cube in red. Anyway we do it, one of the faces ABCDABCD and A′B′C′D′A'B'C'D' has at least three red vertices. Without loss of generality, suppose A,B,CA, B, C are red.

If DD is also red, the face A′B′C′D′A'B'C'D' has only one red vertex; if X′X' is the red vertex, with X∈{A,B,C,D}X \in \{A, B, C, D\}, then all the adjacent vertices of XX are colored red.

If DD is not red, the face A′B′C′D′A'B'C'D' has two red vertices. If one of B′B' or D′D' is red, then the adjacent vertices of BB, respectively DD, are all red. Otherwise, A′A' and C′C' are red.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.