A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem

DOI10.1007/s00454-011-9332-1zbMath1237.05054arXiv1012.5890OpenAlexW2067339112MaRDI QIDQ411397

Roman N. Karasev

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

zbMATH Keywords

simplicial depthmultiplicity of map

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Extremal problems for pairs of triangles, Helly-type theorems for the diameter, A note on lower bounds for colourful simplicial depth, On expansion and topological overlap, Intersection theorems for triangles, Carathéodory's theorem in depth, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, The intersection of a matroid and an oriented matroid, An analogue of Gromov's waist theorem for coloring the cube, A new lower bound based on Gromov's method of selecting heavily covered points, Ramanujan complexes and high dimensional expanders, Upper bounds for stabbing simplices by a line, 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, Quantitative \((p, q)\) theorems in combinatorial geometry, Tverberg’s theorem is 50 years old: A survey, On Gromov's method of selecting heavily covered points, Bounds for Pach's selection theorem and for the minimum solid angle in a simplex, On the chromatic number of generalized Kneser hypergraphs, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, The filling problem in the cube

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