On the number of distinct differences in an intersecting family

被引：0
|
作者：
Frankl, Peter [1 ,2 ]
机构：
[1] Renyi Inst, Budapest, Hungary
[2] MIPT, Moscow, Russia
来源：
DISCRETE MATHEMATICS | 2021年 / 344卷 / 02期
关键词：
Finite sets; Intersecting family; Setwise difference;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a family F of subsets define F \ F = {F \ F' : F, F' is an element of F}. The family F is called intersecting if F boolean AND F' not equal theta for all F, F' is an element of F. We prove best possible upper bounds for vertical bar F \ F vertical bar in the case that F is intersecting. (c) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数：4
相关论文
共 50 条
12345