Optimal bounds for the colored Tverberg problem

DOI10.4171/JEMS/516zbMath1327.52009arXiv0910.4987OpenAlexW2963084798MaRDI QIDQ2344495

Benjamin Matschke, Pavle V. M. Blagojević, Günter M. Ziegler

Publication date: 15 May 2015

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.4987

zbMATH Keywords

chessboard complexesequivariant obstruction theoryBarany-Larman conjectureoptimal colored Tverberg theorem

Mathematics Subject Classification ID

Fixed points and coincidences in algebraic topology (55M20) Erd?s problems and related topics of discrete geometry (52C10) Helly-type theorems and geometric transversal theory (52A35) Equivariant operations and obstructions in algebraic topology (55S91)

Related Items (38)

On a conjecture of Karasev ⋮ Tverberg's theorem, disks, and Hamiltonian cycles ⋮ Tolerance for colorful Tverberg partitions ⋮ Generalized chessboard complexes and discrete Morse theory ⋮ On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture ⋮ The coloured Tverberg theorem, extensions and new results ⋮ Fair splittings by independent sets in sparse graphs ⋮ Envy-free division via configuration spaces ⋮ A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem ⋮ Intersecting diametral balls induced by a geometric graph ⋮ Theorems of Carathéodory, Helly, and Tverberg without dimension ⋮ Plus minus analogues for affine Tverberg type results ⋮ Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story ⋮ Dense point sets with many halving lines ⋮ On levels in arrangements of surfaces in three dimensions ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ A local criterion for Tverberg graphs ⋮ A geometric proof of the colored Tverberg theorem ⋮ Regular polygonal partitions of a Tverberg type ⋮ Robust Tverberg and Colourful Carathéodory Results via Random Choice ⋮ Multiple chessboard complexes and the colored Tverberg problem ⋮ Quantitative combinatorial geometry for continuous parameters ⋮ Equal coefficients and tolerance in coloured Tverberg partitions ⋮ Chessboard complexes indomitable ⋮ Symmetric multiple chessboard complexes and a new theorem of Tverberg type ⋮ A user's guide to the topological Tverberg conjecture ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Quantitative combinatorial geometry for concave functions ⋮ A Tverberg type theorem for matroids ⋮ SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM ⋮ The crossing Tverberg theorem ⋮ Projective center point and Tverberg theorems ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Invariants of graph drawings in the plane ⋮ Counterexamples to the colorful Tverberg conjecture for hyperplanes ⋮ No-dimensional Tverberg theorems and algorithms ⋮ Helly-type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chessboard complexes indomitable
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• A geometric proof of the colored Tverberg theorem
• Torsion in the matching complex and chessboard complex
• Tverberg's theorem with constraints
• Transformation groups
• The colored Tverberg's problem and complexes of injective functions
• Shellability of chessboard complexes
• Erratum to ``Notes on the topological Tverberg theorem [Discrete Math. 241, 207-233 (2001)]
• Simplicial complexes of graphs
• On the number of halving planes
• Using equivariant obstruction theory in combinatorial geometry
• On a Topological Generalization of a Theorem of Tverberg
• A Colored Version of Tverberg's Theorem
• Chessboard Complexes and Matching Complexes
• A Generalization of Radon's Theorem
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Tverberg partitions and Borsuk-Ulam theorems.

This page was built for publication: Optimal bounds for the colored Tverberg problem