Very colorful theorems (Q2391193): Difference between revisions

In 1981, \textit{Imre Bárány} [Discrete Math. 40, 141--152 (1982; Zbl 0492.52005)] observed that some classical results from combinatorial geometry, as Helly's theorem, Carathéodory's theorem, Kirchberger's theorem admit colorful versions. In this interesting paper are obtained several generalizations of colorful theorems, which are called by authors ``very colorful'' theorems. For instance, very colorful Carathéodory theorem can be formulated as follows: Let \(A\) be a finite set in \(\mathbb{R}^d\) colored with \(d+1\) different colors. If for every colorful subset \(A'\) with \(\text{card\,} A'=n+1\), \(0\not\in coA'\) then there exist two colors such that the convex subset of all points of these colors does not contain the origin.