Realizing an m-uniform four-chromatic hypergraph with disks

Gábor Damásdi, Pálvölgyi Dömötör

We prove that for every $m$ there is a finite point set $\mathcal{P}$ in the plane such that no matter how $\mathcal{P}$ is three-colored, there is always a disk containing exactly…