New lower bounds for t-coverings

DOI10.1002/JCD.21591MaRDI QIDQ6573098zbMATH OpenFDO

Authors Daniel Horsley, Rakhi Singh

Publication date 16 July 2024

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

Full work available at URL https://doi.org/10.1002/JCD.21591

zbMATH Keywords

\(t\)-coveringFisher's inequalityhigher incidence matrix

Mathematics Subject Classification ID

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

Recommendations

• Generalising Fisher's inequality to coverings and packings
• A lower bound for the number of blocks of t - (v,k, ) designs with t odd
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• scientific article; zbMATH DE number 5233136
• scientific article; zbMATH DE number 894708

Cites work

• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Covering designs on 13 blocks revisisted
• Covering pairs by q^ 2+q+1 sets
• Generalising Fisher's inequality to coverings and packings
• scientific article; zbMATH DE number 3116601 (Why is no real title available?)
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3900774 (Why is no real title available?)
• scientific article; zbMATH DE number 3695222 (Why is no real title available?)
• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 3797772 (Why is no real title available?)
• scientific article; zbMATH DE number 3198027 (Why is no real title available?)
• scientific article; zbMATH DE number 3104192 (Why is no real title available?)
• Improved lower bounds on k‐independence
• Incidence matrices of t-designs
• Infinite Classes of Covering Numbers
• Lower bounds for coverings of pairs by large blocks
• New constructions for covering designs
• On a packing and covering problem
• On coverings
• On some covering designs
• On t-designs
• On the non-existence of pair covering designs with at least as many points as blocks
• The CRC handbook of combinatorial designs

This page was built for publication: New lower bounds for \(t\)-coverings

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