A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
From MaRDI portal
Publication:411397
DOI10.1007/s00454-011-9332-1zbMath1237.05054arXiv1012.5890MaRDI QIDQ411397
Publication date: 4 April 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.5890
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
Tverberg’s theorem is 50 years old: A survey, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, The filling problem in the cube, A note on lower bounds for colourful simplicial depth, A new lower bound based on Gromov's method of selecting heavily covered points, Ramanujan complexes and high dimensional expanders, A slight improvement to the colored Bárány's theorem, On eigenvalues of random complexes, Positive-fraction intersection results and variations of weak epsilon-nets, On Gromov's method of selecting heavily covered points, Bounds for Pach's selection theorem and for the minimum solid angle in a simplex, The intersection of a matroid and an oriented matroid, On expansion and topological overlap, An analogue of Gromov's waist theorem for coloring the cube, Quantitative \((p, q)\) theorems in combinatorial geometry, Extremal problems for pairs of triangles, Intersection theorems for triangles, Upper bounds for stabbing simplices by a line, On the chromatic number of generalized Kneser hypergraphs, Carathéodory's theorem in depth, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Helly-type theorems for the diameter
Cites Work
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- On a notion of data depth based on random simplices
- The number of triangles covering the center of an \(n\)-set
- A generalization of Caratheodory's theorem
- The colored Tverberg's problem and complexes of injective functions
- A Tverberg-type result on multicolored simplices
- Optimal bounds for the colored Tverberg problem
- Overlap properties of geometric expanders
- A Colored Version of Tverberg's Theorem
