The Stein-Lovász Theorem and Its Applications to Some Combinatorial arrays

@inproceedings{Deng2008TheST,
  title={The Stein-Lov{\'a}sz Theorem and Its Applications to Some Combinatorial arrays},
  author={D. Deng and Yuan Zhang and Pak Ching Li and G. H. John van Rees},
  year={2008}
}
The Stein-Lovász Theorem can be used to get existence results for some combinatorial problems using constructive methods rather than probabilistic methods. In this paper, we discuss applications of the Stein-Lovász Theorem to some combinatorial set systems and arrays, including perfect hash families, separating hash families, splitting systems, covering designs, lotto designs and ∆-free systems. We also compare some of the bounds obtained from the Stein-Lovász Theorem to those using the basic… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

and G

  • P. C. Li
  • H. J. van Rees. Lotto Designs. in Handbook of…
  • 2007

Tran van Trung and R

  • D. R. Stinson
  • Wei. Secure frameproof codes, key distribution…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…