2000 character limit reached
A note on the colorful fractional Helly theorem
Published 17 Nov 2015 in math.CO | (1511.05290v2)
Abstract: Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the two, obtaining a colorful fractional Helly theorem. In this paper, we give an improved version of their result.
Sponsor
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.