Colored Tverberg theorem with new constraints on the faces (Q6181128)

In his well-known paper from 1959, \textit{B. J. Birch} [Proc. Camb. Philos. Soc. 55, 289--293 (1959; Zbl 0089.38502)] conjectured that any \((r - 1)(d + 1) + 1\) points in \(\mathbb{R}^d\) can be partitioned in \(N=(r-1)(d + 1)\) subsets whose convex hulls have a common point. The conjecture was proved by \textit{H. Tverberg} [J. Lond. Math. Soc. 41, 123--128 (1966; Zbl 0131.20002)], and since then, the result has been known as the Tverberg Theorem. In the paper under review, the authors prove a version of the Colored Tverberg Theorem with new constraints on the faces, in which they limit the number of faces with each one of the colors.