MathDB
Miklós Schweitzer 2002, Problem 8

Source: Miklós Schweitzer 2002

July 30, 2016
college contestsMiklos Schweitzercombinatorics

Problem Statement

Prove that there exists an absolute constant cc such that any set HH of nn points of the plane in general position can be coloured with clognc\log n colours in such a way that any disk of the plane containing at least one point of HH intersects some colour class of HH in exactly one point.