Tolerance for colorful Tverberg partitions
From MaRDI portal
Publication:2136209
DOI10.1016/j.ejc.2022.103527zbMath1487.05029arXiv2005.13495OpenAlexW3032629514MaRDI QIDQ2136209
Publication date: 10 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.13495
Cites Work
- Unnamed Item
- A generalisation of Tverberg's theorem
- Equal coefficients and tolerance in coloured Tverberg partitions
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- A generalization of Caratheodory's theorem
- The colored Tverberg's problem and complexes of injective functions
- Tverberg's theorem via number fields
- New lower bounds for Tverberg partitions with tolerance in the plane
- Tverberg partitions as weak epsilon-nets
- Optimal bounds for the colored Tverberg problem
- Very colorful theorems
- A note on the Tolerant Tverberg Theorem
- Algorithms for Tolerated Tverberg Partitions
- Tverberg plus constraints
- Tverberg's Theorem at 50: Extensions and Counterexamples
- A Colored Version of Tverberg's Theorem
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Tverberg’s theorem is 50 years old: A survey
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Probability Inequalities for Sums of Bounded Random Variables
- A Generalization of Radon's Theorem
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope
This page was built for publication: Tolerance for colorful Tverberg partitions