Problem

Source: Baltic Way 1999

Tags: combinatorics proposed, combinatorics



May the points of a disc of radius $1$ (including its circumference) be partitioned into three subsets in such a way that no subset contains two points separated by a distance $1$?