Helly-type theorems for the diameter

25 Sep 2015  ·  Soberón Pablo ·

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem... In particular, the fractional and $(p,q)$ versions work with conditions where the corresponding Helly theorem does not. We also include variants of Tverberg's theorem, B\'ar\'any's point selection theorem and the existence of weak epsilon-nets for convex sets with diameter estimates. read more

PDF Abstract
No code implementations yet. Submit your code now

Categories


Metric Geometry Combinatorics