A geometric proof of the colored Tverberg theorem
From MaRDI portal
Publication:664361
DOI10.1007/s00454-011-9368-2zbMath1242.52009arXiv1008.5275OpenAlexW2109256783WikidataQ105336419 ScholiaQ105336419MaRDI QIDQ664361
Uli Wagner, Martin Tancer, Ji{ří} Matoušek
Publication date: 1 March 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.5275
Partitions of sets (05A18) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Relations of low-dimensional topology with graph theory (57M15) Other problems of combinatorial convexity (52A37) Helly-type theorems and geometric transversal theory (52A35)
Related Items
On the number of colored Birch and Tverberg partitions ⋮ Equal coefficients and tolerance in coloured Tverberg partitions ⋮ A user's guide to the topological Tverberg conjecture ⋮ Invariants of graph drawings in the plane ⋮ Optimal bounds for the colored Tverberg problem ⋮ No-dimensional Tverberg theorems and algorithms
Cites Work
- Chessboard complexes indomitable
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- The colored Tverberg's problem and complexes of injective functions
- Generalized Kneser coloring theorems with combinatorial proofs
- Tverberg's theorem via number fields
- A combinatorical proof of Kneser's conjecture
- Note on the colored Tverberg theorem
- Optimal bounds for the colored Tverberg problem
- On the number of halving planes
- A Generalized van Kampen-Flores Theorem
- On a common generalization of Borsuk's and Radon's theorem
- On a Topological Generalization of a Theorem of Tverberg
- A generalization of Radon's theorem II
- A Colored Version of Tverberg's Theorem
- Chessboard Complexes and Matching Complexes
- Convex Polytopes
- A Generalization of Radon's Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A geometric proof of the colored Tverberg theorem
