当前位置: X-MOL 学术Eur. J. Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the size of shadow-added intersecting families
European Journal of Combinatorics ( IF 1.0 ) Pub Date : 2020-09-16 , DOI: 10.1016/j.ejc.2020.103243
Peter Frankl

Let n2k1>1, [n]={1,2,,n}. For a family F of k-subsets of [n] let F be the immediate shadow (cf. Definition 1.1) of F. Suppose that |FF|2 for all F,FF. We conjecture that |F|+|F|3n2k2+n2k3 and prove it for n=2k1, n3(k1) and also for k10. This problem is somewhat unusual but we exhibit deep connections to the Erdős–Ko–Rado Theorem and to the Erdős Matching Conjecture. Some related problems are also considered.



中文翻译:

影子相交家庭的规模

ñ2ķ-1个>1个[ñ]={1个2ñ}。对于一个家庭Fķ-的子集 [ñ]F 是...的直接阴影(参见定义1.1) F。假设|FF|2 对所有人 FFF。我们推测|F|+|F|3ñ-2ķ-2+ñ-2ķ-3 并证明 ñ=2ķ-1个ñ3ķ-1个 并且也 ķ10。这个问题多少有些特殊,但是我们与Erdős-Ko-Rado定理和Erdős匹配猜想有着深厚的联系。还考虑了一些相关问题。

更新日期:2020-09-16
down
wechat
bug