Pavle Blagojevic, Benjamin Matschke, and Guenter Ziegler settled for the case that is a prime, the “colorful Tverberg’s conjecture.” (Problem 6 in this post.) This gives a sharp version for Zivaljevic and Vrecica theorem, and crossed the “connectivity of chessboard complexes barrier”. Here is the link to the breakthrough paper.

### Like this:

Like Loading...

*Related*

I think this is the new version:

http://front.math.ucdavis.edu/0911.2692

I think this is already a follow-up paper with further results

Pingback: Seven Problems Around Tverberg’s Theorem | Combinatorics and more

Pingback: Seven Problems Around Tverberg’s Theorem | Combinatorics and more