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

DOI10.1007/S00454-011-9332-1MaRDI QIDQ411397zbMATH OpenOpenAlexFDO

Authors Roman 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

multiplicity of mapsimplicial depth

Mathematics Subject Classification ID

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

Abstract: A short and almost elementary proof of the Boros-F"uredi-B'ar'any-Pach-Gromov theorem on the multiplicity of covering by simplices in $mathbb{R}^d$ is given.

Cites work

• A Colored Version of Tverberg's Theorem
• A generalization of Caratheodory's theorem
• A Tverberg-type result on multicolored simplices
• On a notion of data depth based on random simplices
• Optimal bounds for the colored Tverberg problem
• Overlap properties of geometric expanders
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• The colored Tverberg's problem and complexes of injective functions
• The number of triangles covering the center of an \(n\)-set

Cited in

(22)

• 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
• The filling problem in the cube
• A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
• Helly-type theorems for the diameter
• A note on lower bounds for colourful simplicial depth
• scientific article; zbMATH DE number 5778599 (Why is no real title available?)
• A new lower bound based on Gromov's method of selecting heavily covered points
• Ramanujan complexes and high dimensional expanders
• Tverberg’s theorem is 50 years old: A survey
• A slight improvement to the colored Bárány's theorem
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• 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
• A direct proof of Gromov's theorem
• The intersection of a matroid and an oriented matroid

This page was built for publication: A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411397)