Some constructions of general covering designs
From MaRDI portal
Publication:456360
zbMATH Open1253.05058arXiv1205.4994MaRDI QIDQ456360FDOQ456360
Authors: Federico Montecalvo
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: Given five positive integers and where and a - general covering design is a pair where is a set of elements (called points) and a multiset of -subsets of (called blocks) such that every -subset of intersects (is covered by) at least members of in at least 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)
- Title not available (Why is that?)
- Title not available (Why is that?)
- General upper bounds on the minimum size of covering designs
- Asymptotic bounds for general covering designs
- Generalized covering designs and clique coverings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some covering designs
- Some \(t\)-designs are minimal \((t+1)\)-coverings
- 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)