On Gromov's method of selecting heavily covered points

DOI10.1007/s00454-014-9584-7zbMath1298.51027OpenAlexW1863203090MaRDI QIDQ742816

Uli Wagner, Ji{ří} Matoušek

Publication date: 19 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-014-9584-7

zbMATH Keywords

selection theoremscofilling profileshigher-dimensional expandersmultiplicities of maps

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20)

Related Items (21)

Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) ⋮ A note on lower bounds for colourful simplicial depth ⋮ Isoperimetric inequalities in simplicial complexes ⋮ On expansion and topological overlap ⋮ Carathéodory's theorem in depth ⋮ An elementary exposition of topological overlap in the plane ⋮ Algorithms for Colourful Simplicial Depth and Medians in the Plane ⋮ The intersection of a matroid and an oriented matroid ⋮ Mixing in High-Dimensional Expanders ⋮ Simplicial complexes: Spectrum, homology and random walks ⋮ A new lower bound based on Gromov's method of selecting heavily covered points ⋮ Ramanujan complexes and high dimensional expanders ⋮ Upper bounds for stabbing simplices by a line ⋮ On eigenvalues of random complexes ⋮ Positive-fraction intersection results and variations of weak epsilon-nets ⋮ Bounds for Pach's selection theorem and for the minimum solid angle in a simplex ⋮ On the Hardness of Switching to a Small Number of Edges ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Random Steiner systems and bounded degree coboundary expanders of every dimension ⋮ Expansion of building-like complexes ⋮ The filling problem in the cube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• Survey article: an elementary illustrated introduction to simplicial sets
• A new lower bound based on Gromov's method of selecting heavily covered points
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Quasifaserungen und unendliche symmetrische Produkte
• Stabbing simplices by points and flats
• Homological connectivity of random 2-complexes
• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• The homotopy groups of the integral cycle groups
• Semi-simplicial complexes and singular homology
• Homological connectivity of random k -dimensional complexes
• Improving the first selection lemma in R ³
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: On Gromov's method of selecting heavily covered points