One-Sided Epsilon-Approximants

DOI10.1007/978-3-319-44479-6_12zbMath1387.05178arXiv1603.05717OpenAlexW2299788535MaRDI QIDQ4604378

Boris Bukh, Gabriel Nivasch

Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Extending the centerpoint theorem to multiple points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for weak epsilon-nets and stair-convexity
• A deterministic view of random sampling and its use in geometry
• Stabbing simplices by points and flats
• \(\epsilon\)-nets and simplex range queries
• A limit theorem for sets of stochastic matrices.
• Tight upper bounds for the discrepancy of half-spaces
• A regularity lemma and twins in words
• Geometric methods in the study of irregularities of distribution
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
• Chasing Ghosts: Competing with Stateful Policies
• Overlap properties of geometric expanders
• A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
• A Randomized Algorithm for Closest-Point Queries
• Point Selections and Weak ε-Nets for Convex Hulls
• Lectures on Polytopes
• Lower bounds on geometric Ramsey functions
• Curves in Rd intersecting every hyperplane at most d + 1 times
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Geometric discrepancy. An illustrated guide

This page was built for publication: One-Sided Epsilon-Approximants