The Quantitative Fractional Helly theorem

Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of B\'ar\'any, Katchalski, and Pach (1982). Improving on several recent works, we prove an optimal combination of these two results. We show that given a family F of n convex sets in Rᵈ such that at least nd+1 of the (d+1) -tuples of F have an intersection of volume at least 1, then one can select ₃, (n) members of F whose intersection has volume at least d (1). Furthermore, with the help of this theorem, we establish a quantitative version of the (p, q) theorem of Alon and Kleitman. Let p q d+1 and let F be a finite family of convex sets in Rᵈ such that among any p elements of F, there are q that have an intersection of volume at least 1. Then, we prove that there exists a family T of O₏, ₐ (1) ellipsoids of volume d (1) such that every member of F contains at least one element of T.