Minimal Completely Separating Systems of k-Sets

@article{Kndgen2001MinimalCS,
  title={Minimal Completely Separating Systems of k-Sets},
  author={Andr{\'e} K{\"u}ndgen and Dhruv Mubayi and Prasad Tetali},
  journal={J. Comb. Theory, Ser. A},
  year={2001},
  volume={93},
  pages={192-198}
}
Let n and k be xed positive integers. A collection C of k-sets of n] is a completely separating system if, for all distinct i; j 2 n], there is an S 2 C for which i 2 S and j 6 2 S. Let R(n; k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k n k k 1+ for every > 0, then 
4 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

On a problem concerning separating systems of a nite set

  • T. J. Dickson
  • J . Combin . Theory
  • 1984

On random generating elements of a nite boolean algebra

  • E. C. Milner
  • Acta . Sci . Math . ( Szeged )
  • 1973

On the factorization of the complete uniform hypergraph , In nite and nite sets ( Colloq . , Keszthely ,

  • Zs. Baranyai
  • Colloq . Math . Soc . Janos Bolyai 10…
  • 1973

Similar Papers

Loading similar papers…