MathDB
IMO LongList 1985 CZS1 - Prove That Subset Exists

Source:

September 10, 2010
combinatoricsIMO Longlist

Problem Statement

Let TT be the set of all lattice points (i.e., all points with integer coordinates) in three-dimensional space. Two such points (x,y,z)(x, y, z) and (u,v,w)(u, v,w) are called neighbors if xu+yv+zw=1|x - u| + |y - v| + |z - w| = 1. Show that there exists a subset SS of TT such that for each pTp \in T , there is exactly one point of SS among pp and its neighbors.