Generalized covering designs and clique coverings - Mathematics > CombinatoricsReport as inadecuate




Generalized covering designs and clique coverings - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: Inspired by the -generalized t-designs- defined by Cameron P. J. Cameron, Ageneralisation of t-designs, Discrete Math. 309 2009, 4835-4842, we definea new class of combinatorial designs which simultaneously provide ageneralization of both covering designs and covering arrays. We then obtain anumber of bounds on the minimum sizes of these designs, and describe somemethods of constructing them, which in some cases we prove are optimal. Many ofour results are obtained from an interpretation of these designs in terms ofclique coverings of graphs.



Author: Robert F. Bailey, Andrea C. Burgess, Michael S. Cavers, Karen Meagher

Source: https://arxiv.org/







Related documents