Tverberg partitions as weak epsilon-nets

Pablo Soberón

We prove a Tverberg-type theorem using the probabilistic method. Given $\epsilon >0$, we find the smallest number of partitions of a set $X$ in $R^d$ into $r$ parts needed in or…