Some constructions of general covering designs

From MaRDI portal
Publication:456360

zbMATH Open1253.05058arXiv1205.4994MaRDI QIDQ456360FDOQ456360


Authors: Federico Montecalvo Edit this on Wikidata


Publication date: 24 October 2012

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

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.


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

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



Recommendations





Cited In (10)





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)