New lower bounds for \(t\)-coverings

DOI10.1002/JCD.21591zbMATH Open1546.05043MaRDI QIDQ6573098

Daniel Horsley, Rakhi Singh

Publication date: 16 July 2024

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

zbMATH Keywords

Fisher's inequality\(t\)-coveringhigher incidence matrix

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalising Fisher's inequality to coverings and packings
• Covering pairs by \(q^ 2+q+1\) sets
• Lower bounds for coverings of pairs by large blocks
• On a packing and covering problem
• On some covering designs
• Incidence matrices of t-designs
• On t-designs
• On coverings
• On the non-existence of pair covering designs with at least as many points as blocks
• Improved lower bounds on k‐independence
• New constructions for covering designs
• Infinite Classes of Covering Numbers
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• Combinatorial Properties of Group Divisible Incomplete Block 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)