Radon numbers and the fractional Helly theorem
From MaRDI portal
Publication:2022784
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3068278 (Why is no real title available?)
- A Generalization of Radon's Theorem
- A Problem of Geometry in R n
- A fractional Helly theorem for convex lattice sets
- A generalization of Caratheodory's theorem
- A topological colorful Helly theorem
- An upper-bound theorem for families of convex sets
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Bounded VC-dimension implies a fractional Helly theorem
- Bounding the piercing number
- Colourful Linear Programming and its Relatives
- Helly’s theorem: New variations and applications
- Improved bounds on weak ε-nets for convex sets
- Intersection patterns of convex sets
- Large cliques in \(C_4\)-free graphs
- Large cliques in hypergraphs with forbidden substructures
- On stirling numbers of the second kind
- On weak \(\epsilon\)-nets and the Radon number
- Partition numbers for trees and ordered sets
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Point Selections and Weak ε-Nets for Convex Hulls
- The colorful Helly theorem and colorful resolutions of ideals
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- The partition conjecture
- Transversal numbers for hypergraphs arising in geometry
- Tverberg's theorem via number fields
- Tverberg’s theorem is 50 years old: A survey
- -nets and simplex range queries
Cited in
(18)- Radon and Helly numbers of segment spaces
- A note on smaller fractional Helly numbers
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- On weak \(\epsilon\)-nets and the Radon number
- Helly-type problems
- 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
- scientific article; zbMATH DE number 4182248 (Why is no real title available?)
- 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)
