Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 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

On $r$-wise $t$-intersecting uniform families (2409.19344v1)

Published 28 Sep 2024 in math.CO

Abstract: We consider families, $\mathcal{F}$ of $k$-subsets of an $n$-set. For integers $r\geq 2$, $t\geq 1$, $\mathcal{F}$ is called $r$-wise $t$-intersecting if any $r$ of its members have at least $t$ elements in common. The most natural construction of such a family is the full $t$-star, consisting of all $k$-sets containing a fixed $t$-set. In the case $r=2$ the Exact Erd\H{o}s-Ko-Rado Theorem shows that the full $t$-star is largest if $n\geq (t+1)(k-t+1)$. In the present paper, we prove that for $n\geq (2.5t){1/(r-1)}(k-t)+k$, the full $t$-star is largest in case of $r\geq 3$. Examples show that the exponent $\frac{1}{r-1}$ is best possible. This represents a considerable improvement on a recent result of Balogh and Linz.

Citations (1)

Summary

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