Title of article
Minimal Completely Separating Systems of k-Sets
Author/Authors
André Kündgen، نويسنده , , André and Mubayi، نويسنده , , Dhruv and Tetali، نويسنده , , Prasad، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
192
To page
198
Abstract
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]
Keywords
uniform hypergraph , Extremal set theory , Antichain , separating family , Baranyaiיs theorem
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series A
Record number
1530549
Link To Document