arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.06122math.COcs.DM
收藏

没有$s$成对不交集的族

Families with no $s$ pairwise disjoint sets

Peter Frankl, Andrey Kupavskii

摘要:

对于整数$n\ge s\ge 2$,令$e(n,s)$表示$|\mathcal F|,$的最大值,其中$\mathcal F$是$n$元素集的子集族,并且$\mathcal F$不包含$s$成对不相交的成员.半个世纪前,Kleitman解决了Erd \H os的猜想,确定了所有$m,s\ge 1$的$e(sm-1,s)$和$e(sm,s)$。这些年来,在一般情况下取得的进展很少。本文提出了一个关于$1<l<s$的$e(sm-l,m)$的值的一般猜想,并证明了它对$s>s_0(l,m).$的有效性。对于$l=2$,我们确定了所有$s\ge 5.$的$e(sm-2,m)$的值。

英文摘要:

For integers $n\ge s\ge 2$ let $e(n,s)$ denote the maximum of $|\mathcal F|,$ where $\mathcal F$ is a family of subsets of an $n$-element set and $\mathcal F$ contains no $s$ pairwise disjoint members. Half a century ago, solving a conjecture of Erd\H os, Kleitman determined $e(sm-1,s)$ and $e(sm,s)$ for all $m,s\ge 1$. During the years very little progress in the general case was made. In the present paper we state a general conjecture concerning the value of $e(sm-l,m)$ for $1<l<s$ and prove its validity for $s>s_0(l,m).$ For $l=2$ we determine the value of $e(sm-2,m)$ for all $s\ge 5.$ Some related results shedding light on the problem from a more general context are proved as well.

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

↑