Minimal Completely Separating Systems of k-Sets

Minimal Completely Separating Systems of k-Sets
复制标题

k-集的最小完全分离系统

DOI:
--
复制
发表时间:
2001
期刊:
Journal of Combinatorial Theory
影响因子:
--
通讯作者:
P. Tetali
P. Tetali
中科院分区:
--
文献类型:
--
作者:
André Kündgen;D. Mubayi;P. Tetali

文献摘要

被引文献

相似文献

设n和k是固定的正整数。[n]的k-集的集合C是完全分离系统,如果对于所有不同的i,j?[n],有一个S?C、我?S和J?S.设R(n,k)表示这样的C的最小尺寸。我们的结果包括表明,如果nk是一个序列与k?nk?k1+?对于每一个?0,则[公式]
Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j?[n], there is an S?C for which i?S and j?S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if nk is a sequence with k?nk?k1+? for every ?>0, then[formula]