Minimal completely separating systems of sets
Ramsay Colin, Ian T. Roberts · CDU eSpace Institutional Repository (Charles Darwin University) · 1996
Let [n] denote an n-set.A subset,) of [n] i from j if i and j t/:.5'.A collection of k-sets n called (n, k) completely if, for each ordered pairdenote the size of a smallest (71" k) completely Amongst other things, it will be shown that R( 71" k) for n > except when n (Hl) 1, and R(71" k) k + 1 for G) n k 2 /2.These results build on and extend those in Ramsay et a1 [8].