arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0657math.CO
收藏

交叉$t$ -相交族的Erd \H os-Ko-Rado定理

An Erd\H os--Ko--Rado theorem for cross $t$-intersecting families

Peter Frankl, Sang June Lee, Mark Siggers, Norihide Tokushige

摘要:

$n$ -集合的$k$ -子集的两个族$\mathcal{A}$和$\mathcal{B}$是{ \em cross $t$ -intersecting},如果对于子集$A \in \mathcal{A}$和$B \in \mathcal{B}$的每个选择,我们有$|A \cap B| \geq t$。我们解决了Erd \H os-Ko-Rado定理的以下简化的交叉$t$-交叉版本:对于所有$n \geq (t+1)(k-t+1)$,两个交叉$t$ -交叉家族$\mathcal{A}, \mathcal{B} \subset\binom{[n]}{k}$的$|\mathcal{A}||\mathcal{B}|$的最大值是$\binom{n-t}{k-t}^2$ .我们对所有$t \geq 14$验证这一点,但对每个固定的$t$验证了许多$n$和$k$。此外,我们证明在这些情况下的唯一性和稳定性的结果,显示,例如,达到这个界限的家庭是唯一的同构。我们还考虑了问题的{ \em $p$ -weight}版本,它来自于$n$ -set的幂集上的乘积测度。

英文摘要:

Two families $\mathcal{A}$ and $\mathcal{B}$, of $k$-subsets of an $n$-set, are {\em cross $t$-intersecting} if for every choice of subsets $A \in \mathcal{A}$ and $B \in \mathcal{B}$ we have $|A \cap B| \geq t$. We address the following conjectured cross $t$-intersecting version of the Erd\H os--Ko--Rado Theorem: For all $n \geq (t+1)(k-t+1)$ the maximum value of $|\mathcal{A}||\mathcal{B}|$ for two cross $t$-intersecting families $\mathcal{A}, \mathcal{B} \subset\binom{[n]}{k}$ is $\binom{n-t}{k-t}^2$. We verify this for all $t \geq 14$ except finitely many $n$ and $k$ for each fixed $t$. Further, we prove uniqueness and stability results in these cases, showing, for instance, that the families reaching this bound are unique up to isomorphism. We also consider a {\em $p$-weight} version of the problem, which comes from the product measure on the power set of an $n$-set.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑