Generalized covering designs and clique coverings

DOI10.1002/JCD.20288MaRDI QIDQ3100732zbMATH OpenOpenAlexFDO

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

Publication date 21 November 2011

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

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)

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.

Recommendations

• Some constructions of general covering designs
• New coverings oft-sets with (t + 1)-sets
• New upper bounds on the minimum size of covering designs
• General upper bounds on the minimum size of covering designs
• Covering \(t\)-sets with \((t+2)\)-sets
• scientific article; zbMATH DE number 894708
• scientific article; zbMATH DE number 1990674
• Constructing designs straightforwardly: Worst arising cases
• scientific article; zbMATH DE number 874507

Cites work

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

Cited in

(9)

• scientific article; zbMATH DE number 1504678 (Why is no real title available?)
• General upper bounds on the minimum size of covering designs
• Generalized packing designs
• Some constructions of general covering designs
• Asymptotic bounds for general covering designs
• Optimal partial clique edge covering guided by potential energy minimization
• On some covering designs
• Maximal-clique partitions and the roller coaster conjecture
• On generalised \(t\)-designs and their parameters

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)