The coloured Tverberg theorem (Q1584149)

The author sets out a version of the coloured Tverberg's theorem [see \textit{H. Tverberg}, J. Lond. Math. Soc. 41, 123--128 (1966; Zbl 0131.20002)] for the case of the controlled colour appearance. This result strengthens the Živaljević and Vrećica theorem [see \textit{R. Živaljević} and \textit{S. Vrećica}, J. Comb. Theory, Ser. A 61, No. 2, 309--318 (1992; Zbl 0782.52003)] already in the case of the colour repetition exclusion. When the number of colours is not prime the number of points of each colour points diminishes by 1 as compared with the original theorem of R. Živaljević and S. Vrećica [loc. cit.].