PROJECTIVE COVERING DESIGNS YEOW

@inproceedings{Chee2006PROJECTIVECD,
  title={PROJECTIVE COVERING DESIGNS YEOW},
  author={Meng Chee and San Ling},
  year={2006}
}
A (2, k, v) covering design is a pair (X, #") such that X is a n-element set and !F is a family of fc-element subsets, called blocks, of X with the property that every pair of distinct elements of X is contained in at least one block. Let C(2, k, v) denote the minimum number of blocks in a (2, k, v) covering design. We construct in this paper a class of (2, k, v) covering designs using number theoretic means, and determine completely the functions C(2,6,6"-28) for all n ^ 0, and C(2,6,6" • 28 5… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

On coverings and (r, ̂ -systems

  • B. I. GARDNER
  • PhD Thesis, Department of Combinatorics and…
  • 1972
Highly Influential
4 Excerpts

ABEL, 'Four mutually orthogonal Latin squares of orders 28 and 52

  • J R.R.
  • J. Combin. Theory Ser. A
  • 1991
1 Excerpt

ASSAF, 'On the spectrum of imbrical designs

  • A. E. MENDELSOHN
  • Ann. Discrete Math
  • 1987
1 Excerpt

SOTTEAU, 'On regular packings and coverings

  • J.-C. BERMOND, D. J. BOND
  • Ann. Discrete Math
  • 1987
1 Excerpt

Introduction to number theory (Springer, Berlin

  • K HUAL.
  • 1982

ROGERS, 'Packings and coverings by triples

  • M.J.R.G. STANTON
  • Ars Combin
  • 1982
1 Excerpt

MULLIN, 'Covering and packing designs

  • R. G. STANTON, R.C.J.G. KALBFLEISH
  • Proceedings of the Second Chapel Hill Conference…
  • 1970
2 Excerpts