Some constructions of general covering designs

MaRDI QIDQ456360zbMATH OpenFDO

Authors Federico Montecalvo

Publication date 24 October 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1205.4994, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p28

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

block designcovering designlotto designTurán system

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Abstract: Given five positive integers $v,m,k,lambda$ and $t$ where $vgeqkgeqt$ and $vgeqmgeqt,$ a $t$-$(v,k,m,lambda)$ general covering design is a pair $(X,mathcalB)$ where $X$ is a set of $v$ elements (called points) and $mathcalB$ a multiset of $k$-subsets of $X$ (called blocks) such that every $m$-subset of $X$ intersects (is covered by) at least $lambda$ members of $mathcalB$ in at least $t$ points. In this article we present new constructions for general covering designs and we generalize some others. By means of these constructions we will be able to obtain some new upper bounds on the minimum size of such designs.

Recommendations

• General upper bounds on the minimum size of covering designs
• Generalized covering designs and clique coverings
• scientific article; zbMATH DE number 5233136
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• scientific article; zbMATH DE number 894708

Cited in

(10)

• scientific article; zbMATH DE number 4132175 (Why is no real title available?)
• scientific article; zbMATH DE number 4021146 (Why is no real title available?)
• scientific article; zbMATH DE number 4039918 (Why is no real title available?)
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• Asymptotic bounds for general covering designs
• On some covering designs
• Generalized covering designs and clique coverings
• scientific article; zbMATH DE number 4134053 (Why is no real title available?)
• General upper bounds on the minimum size of covering designs
• Zero-sum flows for Steiner systems

This page was built for publication: Some constructions of general covering designs

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