No label defined (Q4549609)

The paper gives an overview of combinatorial results connected to Tverberg's theorem (every subset of at least \((m-1)(d+1)+1\) points of \(\mathbb{R}^d\) has a partition into \(m\) subsets with intersecting convex hulls), gives hints of an `elementary' proof of it, and terminates in the open question of existence of a purely combinatorial proof. Recent results of the author are mentioned for \(d=3,4\), which partially solve Reay's conjectured extension of Tverberg: every subset of at least \((m-1)(d+1)+k+1\) points of \(\mathbb{R}^d\) has a partition into \(m\) subsets with convex hulls intersection of dimension at least \(k\). For the entire collection see [Zbl 0966.00021].