Photo from archive.org
A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we answer a question of Kalai, by showing a fractional Helly theorem… Click to show full abstract
A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we answer a question of Kalai, by showing a fractional Helly theorem for convexity spaces with bounded Radon number. As a consequence we also get a weak ε -net theorem for convexity spaces with bounded Radon number. This answers a question of Bukh and extends a recent result of Moran and Yehudayoff.
Keywords:
numbers fractional;
helly theorem;
radon numbers;
convexity;
fractional helly;
radon number
Journal Title: Israel Journal of Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Israel Journal of Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!