A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
arXiv:1012.5890 · doi:10.1007/s00454-011-9332-1
Abstract
A short and almost elementary proof of the Boros-Füredi-Bárány-Pach-Gromov theorem on the multiplicity of covering by simplices in is given.
References in corpus (1)
Cited by in corpus (6)
- A new lower bound based on Gromov's method of selecting heavily covered points
- Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
- Borsuk-Ulam type theorems for metric spaces
- An analogue of Gromov's waist theorem for coloring the cube
- On Gromov's Method of Selecting Heavily Covered Points
- Computational Lower Bounds for Colourful Simplicial Depth