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

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

References Powered by Scopus

A generalization of carathéodory's theorem

215Citations
N/AReaders
Get full text

Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry

151Citations
N/AReaders
Get full text

The colored Tverberg's problem and complexes of injective functions

110Citations
N/AReaders
Get full text

Cited by Powered by Scopus

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

64Citations
N/AReaders
Get full text

Tverberg'S theorem is 50 Years Old: A survey

41Citations
N/AReaders
Get full text

A polynomial regularity lemma for semialgebraic hypergraphs and its application s in geometry and property testing

36Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers over time

‘11‘14‘15‘16‘17‘18‘2000.751.52.253

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 3

43%

Professor / Associate Prof. 2

29%

Lecturer / Post doc 1

14%

Researcher 1

14%

Readers' Discipline

Tooltip

Mathematics 4

44%

Computer Science 3

33%

Agricultural and Biological Sciences 1

11%

Pharmacology, Toxicology and Pharmaceut... 1

11%

Save time finding and organizing research with Mendeley

Sign up for free
0