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

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.

About these ads

3 thoughts on “Optimal Colorful Tverberg’s Theorem by Blagojecic, Matschke, and Ziegler

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

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s