Mathematics – Combinatorics
Scientific paper
2010-12-29
Mathematics
Combinatorics
Scientific paper
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.
No associations
LandOfFree
A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-610268