Abstract

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, Barany's point selection theorem and the existence of weak epsilon-nets for convex sets with diameter estimates.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call