EXPLICIT CONSTRUCTION OF EXPONENTIAL SIZED FAMILIES OF K-INDEPENDENT SETS

被引:71
作者
ALON, N
机构
关键词
D O I
10.1016/0012-365X(86)90161-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:191 / 193
页数:3
相关论文
共 6 条
[1]   FAMILIES OF FINITE SETS IN WHICH NO SET IS COVERED BY THE UNION OF 2 OTHERS [J].
ERDOS, P ;
FRANKL, P ;
FUREDI, Z .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (02) :158-166
[2]  
ERDOS P, 1984, FAMILIES FINITE SETS
[3]  
Friedman J., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P506, DOI 10.1109/SFCS.1984.715953
[4]  
Kleitman D. J., 1973, Discrete Mathematics, V6, P255, DOI 10.1016/0012-365X(73)90098-8
[5]   INTERSECTIONS OF K-ELEMENT SETS [J].
KLEITMAN, DJ ;
SHEARER, J ;
STURTEVANT, D .
COMBINATORICA, 1981, 1 (04) :381-384
[6]   ON QUALITATIVELY INDEPENDENT PARTITIONS AND RELATED PROBLEMS [J].
POLJAK, S ;
PULTR, A ;
RODL, V .
DISCRETE APPLIED MATHEMATICS, 1983, 6 (02) :193-205