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 pattern of the convex hulls of the parts. in this talk we will talk about intersection patterns and how tverberg's theorem is but a special case of a more general situation where other simplicial complexes arise as nerves.