2000 character limit reached
Quantitative Fractional Helly and $(p,q)$-Theorems
Published 16 Dec 2020 in math.MG and math.CO | (2012.08964v2)
Abstract: We consider quantitative versions of Helly-type questions, that is, instead of finding a point in the intersection, we bound the volume of the intersection. Our first main geometric result is a quantitative version of the Fractional Helly Theorem of Katchalski and Liu, the second one is a quantitative version of the $(p,q)$-Theorem of Alon and Kleitman.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.