Radon numbers and the fractional Helly theorem
From MaRDI portal
Publication:2022784
DOI10.1007/S11856-021-2102-8zbMATH Open1469.52007arXiv1903.01068OpenAlexW3131216722MaRDI QIDQ2022784FDOQ2022784
Authors: Andreas Holmsen, Donggyu Lee 
Publication date: 29 April 2021
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Abstract: A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we show a fractional Helly theorem for convexity spaces with a bounded Radon number, answering a question of Kalai. As a consequence we also get a weak epsilon-net theorem for convexity spaces with a bounded Radon number. This answers a question of Bukh and extends a recent result of Moran and Yehudayoff.
Full work available at URL: https://arxiv.org/abs/1903.01068
Recommendations
Axiomatic and generalized convexity (52A01) Helly-type theorems and geometric transversal theory (52A35) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\epsilon\)-nets and simplex range queries
- A generalization of Caratheodory's theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partition numbers for trees and ordered sets
- On stirling numbers of the second kind
- A Generalization of Radon's Theorem
- An upper-bound theorem for families of convex sets
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Transversal numbers for hypergraphs arising in geometry
- Bounded VC-dimension implies a fractional Helly theorem
- Helly’s theorem: New variations and applications
- A Problem of Geometry in R n
- Title not available (Why is that?)
- Intersection patterns of convex sets
- Colourful Linear Programming and its Relatives
- A fractional Helly theorem for convex lattice sets
- Tverberg's theorem via number fields
- On weak \(\epsilon\)-nets and the Radon number
- Point Selections and Weak ε-Nets for Convex Hulls
- The colorful Helly theorem and colorful resolutions of ideals
- The partition conjecture
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Large cliques in \(C_4\)-free graphs
- A topological colorful Helly theorem
- Title not available (Why is that?)
- Improved bounds on weak ε-nets for convex sets
- Bounding the piercing number
- Tverberg’s theorem is 50 years old: A survey
- Large cliques in hypergraphs with forbidden substructures
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Cited In (18)
- Radon and Helly numbers of segment spaces
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- A note on smaller fractional Helly numbers
- Helly-type problems
- On weak \(\epsilon\)-nets and the Radon number
- Bounding Radon numbers via Betti numbers
- Some new results on geometric transversals
- Radon numbers grow linearly
- Embeddings of \(k\)-complexes into \(2k\)-manifolds
- Bounding Radon number via Betti numbers
- Fractional Helly theorem for Cartesian products of convex sets
- Title not available (Why is that?)
- Colorful Carathéodory, Helly and sierksma numbers of convexity spaces
- Generalised Helly and Radon numbers
- Orientation of convex sets
- Bounded VC-dimension implies a fractional Helly theorem
- Combinatorial properties of nonarchimedean convex sets
- On weak \(\varepsilon\)-nets and the Radon number
This page was built for publication: Radon numbers and the fractional Helly theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022784)
