FAMILIES OF FINITE SETS SATISFYING A UNION CONDITION

被引：11

作者：

FRANKL, P

机构：

来源：

DISCRETE MATHEMATICS | 1979年 / 26卷 / 02期

关键词：

D O I：

10.1016/0012-365X(79)90117-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let n, t, k be integers, n ≥ t ≥ 1, k ≥ 2. Let x = {1, 2, ..., n}. Let F be a family of subsets of x such that the cardinality of the union of any k members of F is at most n -t. How large |F| can be and which are the optimal families? We answer these questions for t ≤ 2k k 150. © 1979.

引用

页码：111 / 118

页数：8