Generalized covering designs and clique coverings

@inproceedings{Bailey2011GeneralizedCD,
  title={Generalized covering designs and clique coverings},
  author={Robert F. Bailey and Andrea C. Burgess and Michael S. Cavers and Karen Meagher},
  year={2011}
}
Inspired by the “generalized t-designs” defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835–4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimum sizes of these designs, and describe some methods of constructing them, which in some cases we prove are optimal. Many of our results are obtained from an… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
2 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

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

A generalisation of t-designs

  • P. J. Cameron
  • Discrete Math
  • 2009
Highly Influential
3 Excerpts

Covering arrays avoiding forbidden edges and edge clique covers

  • E. Maltais
  • M.Sc. thesis, University of Ottawa,
  • 2009
2 Excerpts

The representation of a graph by set intersections

  • A. W. Goodman, L. Pósa
  • Canad . J . Math .
  • 2009

Stinson , Quorum systems constructed from combinatorial designs

  • J. H. Dinitz, R. D.
  • Inform . and Comput .
  • 2007

Similar Papers

Loading similar papers…