Some t-designs are minimal (t+1)-coverings

DOI10.1016/S0012-365X(98)00023-5zbMATH Open0955.05014MaRDI QIDQ1584345FDOQ1584345

Authors: Iliya Bluskov 

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 874507
• scientific article; zbMATH DE number 5233136
• General upper bounds on the minimum size of covering designs
• Some constructions of general covering designs
• Covering \(t\)-sets with \((t+2)\)-sets

zbMATH Keywords

covering numberfinite geometryminimal coveringcovering design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Cites Work

• On Quadruple Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On coverings
• Intersections among Steiner systems
• New constructions for covering designs
• Towards a Large Set of Steiner Quadruple Systems
• File organization schemes based on finite geometries
• Combinatorial Information Retrieval Systems for Files
• Title not available (Why is that?)
• Designs with maximally different blocks and \(v=15,16\)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The minimum independence number for designs
• On \(q\)-covering designs
• New lower bounds for \(t\)-coverings
• Title not available (Why is that?)
• Some constructions of general covering designs
• Title not available (Why is that?)

This page was built for publication: Some \(t\)-designs are minimal \((t+1)\)-coverings

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