Existence of large sets of coverings with block size 3

DOI10.1002/JCD.20077zbMATH Open1099.05020OpenAlexW2090202668MaRDI QIDQ5487775FDOQ5487775

Author name not available (Why is that?)

Publication date: 12 September 2006

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

Full work available at URL: https://doi.org/10.1002/jcd.20077

Recommendations

• Large sets of coverings
• scientific article; zbMATH DE number 2104817
• scientific article; zbMATH DE number 2148771
• scientific article; zbMATH DE number 3889541
• On some covering designs

zbMATH Keywords

candelabra system

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites Work

• A new existence proof for large sets of disjoint Steiner triple systems
• Minimal coverings of pairs by triples

Cited In (5)

• Lower bounds for coverings of pairs by large blocks
• Title not available (Why is that?)
• Asymptotic Bounds for General Covering Designs
• Finding large 3-free sets. I. The small \(n\) case
• Title not available (Why is that?)

This page was built for publication: Existence of large sets of coverings with block size 3

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