Generalized covering designs and clique coverings

DOI10.1002/JCD.20288zbMATH Open1230.05090arXiv1011.3804OpenAlexW1982048527MaRDI QIDQ3100732FDOQ3100732

Andrea Burgess, M. Cavers, Robert F. Bailey, K. Meagher

Publication date: 21 November 2011

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1011.3804

zbMATH Keywords

covering designcovering arraygeneralized covering design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Products of mixed covering arrays of strength two
• A Generalization of a Theorem due to MacNeish
• On a packing and covering problem
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• A generalisation of \(t\)-designs
• Error-correcting codes from permutation groups
• On coverings
• Designs in product association schemes
• Locally trivial t-designs and t-designs without repeated blocks
• Mixed block designs
• On generalised \(t\)-designs and their parameters
• Merging covering arrays and compressing multiple sequence alignments
• New constructions for covering designs
• The Representation of a Graph by Set Intersections
• Covering arrays with mixed alphabet sizes
• A simple lower bound on edge coverings by cliques
• Antiblocking systems and PD-sets
• Covering arrays avoiding forbidden edges
• On qualitatively independent partitions and related problems
• Qualitative independence and Sperner problems for directed graphs
• Asymptotically good coverings
• A problem in partitions
• Asymptotically optimal covering designs
• Quorum systems constructed from combinatorial designs

Cited In (7)

• Title not available (Why is that?)
• Asymptotic Bounds for General Covering Designs
• General upper bounds on the minimum size of covering designs
• Generalized packing designs
• Optimal partial clique edge covering guided by potential energy minimization
• On some covering designs
• Maximal-clique partitions and the roller coaster conjecture

Recommendations

• New upper bounds on the minimum size of covering designs 👍 👎
• Some constructions of general covering designs 👍 👎
• Constructing designs straightforwardly: Worst arising cases 👍 👎
• Covering \(t\)-sets with \((t+2)\)-sets 👍 👎
• New coverings oft-sets with (t + 1)-sets 👍 👎
• General upper bounds on the minimum size of covering designs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Generalized covering designs and clique coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100732)