Generalising Fisher's inequality to coverings and packings

DOI10.1007/s00493-016-3326-9zbMath1399.05030arXiv1409.0485OpenAlexW2964050537MaRDI QIDQ681600

Daniel Horsley

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.0485

zbMATH Keywords

Johnson boundpacking designFisher inequalitycovering designSchönheim bound

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (3)

More nonexistence results for symmetric pair coverings ⋮ MAX for \(k\)-independence in multigraphs ⋮ Almost designs and their links with balanced incomplete block designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering pairs by \(q^ 2+q+1\) sets
• Lower bounds for coverings of pairs by large blocks
• On a packing and covering problem
• Covering graphs: The covering problem solved
• Packing graphs: The packing problem solved
• Covering and packing for pairs
• On coverings
• On the non-existence of pair covering designs with at least as many points as blocks
• The Turán problem for projective geometries
• Improved lower bounds on k‐independence
• Infinite Classes of Covering Numbers
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• A Recurring Theorem on Determinants
• Combinatorial Properties of Group Divisible Incomplete Block Designs

This page was built for publication: Generalising Fisher's inequality to coverings and packings