Optimal Colorful Tverberg’s Theorem by Blagojecic, Matschke, and Ziegler

By Gil Kalai

Pavle Blagojevic, Benjamin Matschke, and Guenter Ziegler settled  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.

2 Responses to “Optimal Colorful Tverberg’s Theorem by Blagojecic, Matschke, and Ziegler”

  1. domotorp Says:

    I think this is the new version:
    http://front.math.ucdavis.edu/0911.2692

  2. Gil Says:

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

Leave a Reply