A slight improvement to the colored Bárány's theorem

zbMath1305.05033arXiv1405.2503MaRDI QIDQ490250

Zilin Jiang

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2503

zbMATH Keywords

discrete geometrypoint selection problemtopological methods in combinatorics

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial probability (60C99)

Related Items (3)

Upper bounds for stabbing simplices by a line ⋮ 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

Cites Work

• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• 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
• Stabbing simplices by points and flats
• The number of triangles covering the center of an \(n\)-set
• A point in many triangles
• Improving the first selection lemma in R ³
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: A slight improvement to the colored Bárány's theorem