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

A rainbow $r$-partite version of the Erdős-Ko-Rado theorem (1605.06752v1)

Published 22 May 2016 in math.CO

Abstract: Let $f(n,r,k)$ be the minimal number such that every hypergraph larger than $f(n,r,k)$ contained in $\binom{[n]}{r}$ contains a matching of size $k$, and let $g(n,r,k)$ be the minimal number such that every hypergraph larger than $g(n,r,k)$ contained in the $r$-partite $r$-graph $[n]{r}$ contains a matching of size $k$. The Erd\H{o}s-Ko-Rado theorem states that $f(n,r,2)=\binom{n-1}{r-1}$~~($r \le \frac{n}{2}$) and it is easy to show that $g(n,r,k)=(k-1)n{r-1}$. The conjecture inspiring this paper is that if $F_1,F_2,\ldots,F_k\subseteq \binom{[n]}{r}$ are of size larger than $f(n,r,k)$ or $F_1,F_2,\ldots,F_k\subseteq [n]{r}$ are of size larger than $g(n,r,k)$ then there exists a rainbow matching, i.e. a choice of disjoint edges $f_i \in F_i$. In this paper we deal mainly with the second part of the conjecture, and prove it for $r\le 3$. \vspace{.1cm} We also prove that for every $r$ and $k$ there exists $n_0=n_0(r,k)$ such that the $r$-partite version of the conjecture is true for $n>n_0$.

Summary

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