Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Best possible bounds on the double-diversity of intersecting hypergraphs (2212.11650v1)

Published 22 Dec 2022 in math.CO

Abstract: For a family $\mathcal{F}\subset \binom{[n]}{k}$ and two elements $x,y\in [n]$ define $\mathcal{F}(\bar{x},\bar{y})={F\in \mathcal{F}\colon x\notin F,\ y\notin F}$. The double-diversity $\gamma_2(\mathcal{F})$ is defined as the minimum of $|\mathcal{F}(\bar{x},\bar{y})|$ over all pairs $x,y$. Let $\mathcal{L}\subset\binom{[7]}{3}$ consist of the seven lines of the Fano plane. For $n\geq 7$, $k\geq 3$ one defines the Fano $k$-graph $\mathcal{F}_{\mathcal{L}}$ as the collection of all $k$-subsets of $[n]$ that contain at least one line. It is proven that for $n\geq 13k2$ the Fano $k$-graph is the essentially unique family maximizing the double diversity over all $k$-graphs without a pair of disjoint edges. Some similar, although less exact results are proven for triple and higher diversity as well.

Citations (1)

Summary

We haven't generated a summary for this paper yet.