Journal ArticleOPEN ACCESS

A Simpler Proof of the Boros-Füredi-Bárány-Pach-Gromov Theorem

Discrete and Computational Geometry (2012) 47(3) 492-495
DOI: 10.1007/s00454-011-9332-1
28Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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 ℝ d is given. © 2011 Springer Science+Business Media, LLC.

Author supplied keywords

Cite

CITATION STYLE

APA

Karasev, R. (2012). A Simpler Proof of the Boros-Füredi-Bárány-Pach-Gromov Theorem. Discrete and Computational Geometry, 47(3), 492–495. https://doi.org/10.1007/s00454-011-9332-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free