2000 character limit reached
Bounded fractional intersecting families are linear in size (2402.14981v2)
Published 22 Feb 2024 in math.CO
Abstract: Using the sunflower method, we show that if $\theta \in (0,1) \cap \mathbb{Q}$ and $\mathcal{F}$ is a $O(n{1/3})$-bounded $\theta$-intersecting family over $[n]$, then $\lvert \mathcal{F} \rvert = O(n)$, and that if $\mathcal{F}$ is $o(n{1/3})$-bounded, then $\lvert \mathcal{F} \rvert \leq (\frac{3}{2} + o(1))n$. This partially solves a conjecture of Balachandran, Mathew and Mishra that any $\theta$-intersecting family over $[n]$ has size at most linear in $n$, in the regime where we have no very large sets.
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.