Radon numbers and the fractional Helly theorem
From MaRDI portal
Publication:2022784
DOI10.1007/S11856-021-2102-8zbMath1469.52007arXiv1903.01068OpenAlexW3131216722MaRDI QIDQ2022784
Donggyu Lee, Andreas F. Holmsen
Publication date: 29 April 2021
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01068
Axiomatic and generalized convexity (52A01) Helly-type theorems and geometric transversal theory (52A35) Combinatorial complexity of geometric structures (52C45)
Related Items (9)
Colorful Carathéodory, Helly and sierksma numbers of convexity spaces ⋮ Radon numbers grow linearly ⋮ Combinatorial properties of nonarchimedean convex sets ⋮ Fractional Helly theorem for Cartesian products of convex sets ⋮ Embeddings of \(k\)-complexes into \(2k\)-manifolds ⋮ Orientation of convex sets ⋮ Discrete geometry. Abstracts from the workshop held January 21--26, 2024 ⋮ Some new results on geometric transversals ⋮ Helly-type problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The colorful Helly theorem and colorful resolutions of ideals
- Lower bounds for weak epsilon-nets and stair-convexity
- Large cliques in \(C_4\)-free graphs
- A topological colorful Helly theorem
- Intersection patterns of convex sets
- An upper-bound theorem for families of convex sets
- \(\epsilon\)-nets and simplex range queries
- Partition numbers for trees and ordered sets
- A generalization of Caratheodory's theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- The partition conjecture
- Tverberg's theorem via number fields
- Transversal numbers for hypergraphs arising in geometry
- A fractional Helly theorem for convex lattice sets
- Bounded VC-dimension implies a fractional Helly theorem
- Bounding the piercing number
- On weak \(\epsilon\)-nets and the Radon number
- Large cliques in hypergraphs with forbidden substructures
- Helly’s theorem: New variations and applications
- A Problem of Geometry in R n
- Point Selections and Weak ε-Nets for Convex Hulls
- Colourful Linear Programming and its Relatives
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Tverberg’s theorem is 50 years old: A survey
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Improved bounds on weak ε-nets for convex sets
- A Generalization of Radon's Theorem
- On stirling numbers of the second kind
This page was built for publication: Radon numbers and the fractional Helly theorem
