Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Jesús A. De Loera, Thomas A. Hogan, Deborah Oliveros +1

Tverberg's theorem says that a set with sufficiently many points in ${\mathbb{R}}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection…