A simpler proof of the Boros-F\"uredi-B\'ar\'any-Pach-Gromov theorem
classification
🧮 math.CO
math.PR
keywords
any-pach-gromovboros-fprooftheoremuredi-balmostcoveringelementary
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.