Coloured Tverberg's theorem
Coloured Tverberg's theorem
Let be colour classes, each consisting of points in . A colourful -partition is a partition of their union into pairwise disjoint sets , each containing one point from every colour class. Coloured Tverberg's theorem. There is a colourful -partition such that their convex hulls intersect. This was conjectured by Bárány, Fürédi and Lovász, and in its full strength was first proposed by Bárány and Larman; it is known when or is prime, but the general case remains open.
Sources & referencesView supporting material
Primary source
Pablo Soberón, “Equal coefficients and tolerance in coloured Tverberg partitions”, arXiv:1204.1202 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.