ALMOST INTERSECTING FAMILIES OF SETS

被引:11
|
作者
Gerbner, Daniel [2 ]
Lemons, Nathan [3 ]
Palmer, Cory [1 ]
Patkos, Balazs [2 ]
Szecsi, Vajk [4 ]
机构
[1] Univ Illinois, Dept Math, Urbana, IL 61801 USA
[2] Hungarian Acad Sci, Alfred Renyi Inst Math, H-1364 Budapest, Hungary
[3] Los Alamos Natl Lab, Div Theoret, Los Alamos, NM 87545 USA
[4] Cent European Univ, Dept Math & Its Applicat, H-1051 Budapest, Hungary
关键词
extremal set theory; intersection theorems; Sperner-type theorems; SYSTEMS; THEOREMS; NUMBER; PAIRS;
D O I
10.1137/120878744
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let us write D-F(G) = {F is an element of F : F boolean AND G = circle divide} for a set G and a family F. Then a family F of sets is said to be (<= l)-almost intersecting (l-almost intersecting) if for any F is an element of F we have vertical bar D-F(F)vertical bar <= l (vertical bar D-F(F)vertical bar = l). In this paper we investigate the problem of finding the maximum size of an (<= l)-almost intersecting (l-almost intersecting) family F.
引用
收藏
页码:1657 / 1669
页数:13
相关论文
共 50 条