On the non-existence of pair covering designs with at least as many points as blocks

DOI10.1007/s00493-011-2639-yzbMath1265.05090MaRDI QIDQ2428629

Victor Scharaschkin, Melinda Buchanan, Daniel Horsley, Darryn E. Bryant, Barbara M. Maenhaut

Publication date: 26 April 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2639-y

zbMATH Keywords

pair covering designs

Mathematics Subject Classification ID

05B30: Other designs, configurations

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05B40: Combinatorial aspects of packing and covering

05C51: Graph designs and isomorphic decomposition

Related Items

Generalising Fisher's inequality to coverings and packings, More nonexistence results for symmetric pair coverings, The nonexistence of a (K₆-e)-decomposition of the complete graphK₂₉

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds for coverings of pairs by large blocks
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
• A survey on the existence ofG-Designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• The nonexistence of a (K₆-e)-decomposition of the complete graphK₂₉
• Combinatorial Problems
• The Nonexistence of Certain Finite Projective Planes
• Combinatorial Properties of Group Divisible Incomplete Block Designs