Drawing discs on a 2019-points configuration
Source: 2019 Baltic Way P10
November 18, 2019
combinatorial geometrycombinatorics
Problem Statement
There are points given in the plane. A child wants to draw (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal , such that for any initial configuration of points it is possible to draw discs with the above property?