2000 character limit reached
Note on the diversity of intersecting families
Published 7 Mar 2019 in math.CO | (1903.03585v1)
Abstract: Let $n=2k+1$ be odd with $k\geq3$. In this note, we give two intersecting families with diversity larger than $\sum_{i=k+1}{2k} \binom {2k}{i}$, which disprove a conjecture of Huang.
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.