IMO LongList 1985 CZS1 - Prove That Subset Exists
Source:
September 10, 2010
combinatoricsIMO Longlist
Problem Statement
Let be the set of all lattice points (i.e., all points with integer coordinates) in three-dimensional space. Two such points and are called neighbors if . Show that there exists a subset of such that for each , there is exactly one point of among and its neighbors.