arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1010.5206math.CO
收藏

无3-单纯形的集合系统

Set systems without a 3-simplex

Michael E. Picollelli

摘要:

一个3-单纯形是四个集合A_1,.,A_4有空交集,使得其中任意三个有非空交集。我们表明,一个集合系统的最大尺寸的n个元素,没有3-单纯形是$2^{n-1} + \binom{n-1}{0} + \binom{n-1}{1} + \binom{n-1}{2}$的所有$n \ge 1$,与平等只实现了家庭的集合要么包含一个给定的元素或大小最多为2。这扩展了Keevash和Mubayi的结果,他们证明了n足够大的结论。

英文摘要:

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} + \binom{n-1}{0} + \binom{n-1}{1} + \binom{n-1}{2}$ for all $n \ge 1$, with equality only achieved by the family of sets either containing a given element or of size at most 2. This extends a result of Keevash and Mubayi, who showed the conclusion for n sufficiently large.

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

↑