{"publisher":"Springer","day":"01","month":"03","year":"2012","intvolume":"        47","extern":1,"date_published":"2012-03-01T00:00:00Z","citation":{"ama":"Matoušek J, Tancer M, Wagner U. A geometric proof of the colored Tverberg theorem. <i>Discrete &#38; Computational Geometry</i>. 2012;47(2):245-265. doi:<a href=\"https://doi.org/10.1007/s00454-011-9368-2\">10.1007/s00454-011-9368-2</a>","ieee":"J. Matoušek, M. Tancer, and U. Wagner, “A geometric proof of the colored Tverberg theorem,” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2. Springer, pp. 245–265, 2012.","short":"J. Matoušek, M. Tancer, U. Wagner, Discrete &#38; Computational Geometry 47 (2012) 245–265.","mla":"Matoušek, Jiří, et al. “A Geometric Proof of the Colored Tverberg Theorem.” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2, Springer, 2012, pp. 245–65, doi:<a href=\"https://doi.org/10.1007/s00454-011-9368-2\">10.1007/s00454-011-9368-2</a>.","ista":"Matoušek J, Tancer M, Wagner U. 2012. A geometric proof of the colored Tverberg theorem. Discrete &#38; Computational Geometry. 47(2), 245–265.","apa":"Matoušek, J., Tancer, M., &#38; Wagner, U. (2012). A geometric proof of the colored Tverberg theorem. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-011-9368-2\">https://doi.org/10.1007/s00454-011-9368-2</a>","chicago":"Matoušek, Jiří, Martin Tancer, and Uli Wagner. “A Geometric Proof of the Colored Tverberg Theorem.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-011-9368-2\">https://doi.org/10.1007/s00454-011-9368-2</a>."},"title":"A geometric proof of the colored Tverberg theorem","quality_controlled":0,"publication_status":"published","issue":"2","publication":"Discrete & Computational Geometry","acknowledgement":"We would like to thank Marek Krcál for useful discussions at initial stages of this research. We also thank Günter M. Ziegler for valuable comments, and Peter Landweber and two anonymous referees for detailed comments and corrections that greatly helped to improve the presentation. In particular, we are indebted to one of the referees for pointing out to us reference [19]. M. Tancer is supported by the grants SVV-2010-261313 (Discrete Methods and Algorithms) and GAUK 49209. U. Wagner’s research is supported by the Swiss National Science Foundation (SNF Projects 200021- 125309 and 200020-125027). ","_id":"2438","doi":"10.1007/s00454-011-9368-2","type":"journal_article","page":"245 - 265","volume":47,"abstract":[{"lang":"eng","text":"The colored Tverberg theorem asserts that for eve;ry d and r there exists t=t(d,r) such that for every set C ⊂ ℝ d of cardinality (d + 1)t, partitioned into t-point subsets C 1, C 2,...,C d+1 (which we think of as color classes; e. g., the points of C 1 are red, the points of C 2 blue, etc.), there exist r disjoint sets R 1, R 2,...,R r⊆C that are rainbow, meaning that {pipe}R i∩C j{pipe}≤1 for every i,j, and whose convex hulls all have a common point. All known proofs of this theorem are topological. We present a geometric version of a recent beautiful proof by Blagojević, Matschke, and Ziegler, avoiding a direct use of topological methods. The purpose of this de-topologization is to make the proof more concrete and intuitive, and accessible to a wider audience."}],"date_updated":"2021-01-12T06:57:29Z","publist_id":"4468","status":"public","date_created":"2018-12-11T11:57:39Z","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Martin Tancer","last_name":"Tancer","first_name":"Martin","orcid":"0000-0002-1191-6714"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Uli Wagner","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568"}]}