Fractional Helly theorem for Cartesian products of convex sets
From MaRDI portal
Publication:6142359
DOI10.1007/s00454-022-00468-8zbMath1529.52006arXiv2108.09962OpenAlexW3194854604MaRDI QIDQ6142359
Jinha Kim, Min-Ki Kim, Jae-Hoon Kim, Debsoumya Chakraborti, Hong Liu
Publication date: 21 December 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09962
Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the colorful fractional Helly theorem
- Large cliques in \(C_4\)-free graphs
- A topological colorful Helly theorem
- Intersection patterns of convex sets
- An extremal problem for sets with applications to graph theory
- A simple proof of the upper bound theorem
- An upper-bound theorem for families of convex sets
- Intersection properties of boxes. I: An upper-bound theorem
- A generalization of Caratheodory's theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- A Turan type problem for interval graphs
- Improved bounds on the Hadwiger-Debrunner numbers
- Piercing axis-parallel boxes
- Transversal numbers for hypergraphs arising in geometry
- Bounded VC-dimension implies a fractional Helly theorem
- On Wegner's inequality for axis-parallel rectangles
- Radon numbers and the fractional Helly theorem
- Large cliques in hypergraphs with forbidden substructures
- Colourful and fractional \((p,q)\)-theorems
- Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Helly’s theorem: New variations and applications
- A Problem of Geometry in R n
- Helly-type problems
- Stronger bounds for weak epsilon-nets in higher dimensions
This page was built for publication: Fractional Helly theorem for Cartesian products of convex sets
