Generalized covering designs and clique coverings

Details Generalized covering designs and clique coverings Generalized covering designs and clique coverings

2010-11-16

arxiv.org/abs/1011.3804v2

Mathematics

Combinatorics

30 pages, 1 figure

Scientific paper

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 interpretation of these designs in terms of clique coverings of graphs.

Affiliated with

Also associated with

No associations

Rating

Generalized covering designs and clique coverings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized covering designs and clique coverings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized covering designs and clique coverings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110174