Optimal bounds for the colored Tverberg problem
From MaRDI portal
(Redirected from Publication:2344495)
Abstract: We prove a "Tverberg type" multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Barany et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Barany & Larman (1992) that is tight in the prime case and asymptotically optimal in the general case. The proof is based on relative equivariant obstruction theory.
Recommendations
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Tight lower bounds for the complexity of multicoloring
- Tight lower bounds for the complexity of multicoloring
- Asymptotically optimal frugal colouring
- Asymptotically optimal frugal colouring
- On the approximability of the maximum interval constrained coloring problem
- On the approximability of the maximum interval constrained coloring problem
- The coloured Tverberg theorem, extensions and new results
- Algorithms and Computation
- Almost optimal solutions for bin coloring problems
Cites work
- scientific article; zbMATH DE number 431992 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 269481 (Why is no real title available?)
- A Colored Version of Tverberg's Theorem
- A Generalization of Radon's Theorem
- A geometric proof of the colored Tverberg theorem
- Chessboard Complexes and Matching Complexes
- Chessboard complexes indomitable
- Erratum to ``Notes on the topological Tverberg theorem [Discrete Math. 241, 207-233 (2001)]
- On a Topological Generalization of a Theorem of Tverberg
- On the number of halving planes
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Shellability of chessboard complexes
- Simplicial complexes of graphs
- The colored Tverberg's problem and complexes of injective functions
- Torsion in the matching complex and chessboard complex
- Transformation groups
- Tverberg partitions and Borsuk-Ulam theorems.
- Tverberg's theorem with constraints
- User's guide to equivariant methods in combinatorics. II
- Using equivariant obstruction theory in combinatorial geometry
- 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
- \(3N\) colored points in a plane
Cited in
(50)- Tverberg's theorem, disks, and Hamiltonian cycles
- A local criterion for Tverberg graphs
- No-dimensional Tverberg theorems and algorithms
- On the number of colored Birch and Tverberg partitions
- A topological central point theorem
- Eliminating Tverberg points. I. An analogue of the Whitney trick
- Optimal colored Tverberg theorems for prime powers
- A User's guide to the topological Tverberg conjecture
- Intersection patterns of finite sets and of convex sets
- Chessboard complexes indomitable
- A geometric proof of the colored Tverberg theorem
- Regular polygonal partitions of a Tverberg type
- Intersecting diametral balls induced by a geometric graph
- Symmetric multiple chessboard complexes and a new theorem of Tverberg type
- A tight colored Tverberg theorem for maps to manifolds
- Splitting loops and necklaces: variants of the square peg problem
- Almost optimal solutions for bin coloring problems
- Quantitative combinatorial geometry for concave functions
- The colored Tverberg's problem and complexes of injective functions
- Tolerance for colorful Tverberg partitions
- A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
- Generalized chessboard complexes and discrete Morse theory
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- On the generalized Erdős-Kneser conjecture: proofs and reductions
- Algorithms and Computation
- On levels in arrangements of surfaces in three dimensions
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- A Tverberg type theorem for matroids
- Counterexamples to the colorful Tverberg conjecture for hyperplanes
- Colored Tverberg theorem with new constraints on the faces
- Projective center point and Tverberg theorems
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
- Helly-type problems
- Tverberg’s theorem is 50 years old: A survey
- The crossing Tverberg theorem
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Invariants of graph drawings in the plane
- On a conjecture of Karasev
- scientific article; zbMATH DE number 718867 (Why is no real title available?)
- Envy-free division via configuration spaces
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Dense point sets with many halving lines
- A tight colored Tverberg theorem for maps to manifolds (extended abstract)
- The coloured Tverberg theorem, extensions and new results
- Multiple chessboard complexes and the colored Tverberg problem
- A Colored Version of Tverberg's Theorem
- Plus minus analogues for affine Tverberg type results
- Quantitative combinatorial geometry for continuous parameters
- Fair splittings by independent sets in sparse graphs
This page was built for publication: Optimal bounds for the colored Tverberg problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344495)
