Bounds on data limits for all-to-all comparison from combinatorial designs

DOI10.1007/S10623-024-01418-6zbMATH Open1548.05077MaRDI QIDQ6618615

Daniel Horsley, Douglas R. Stinson, Joanne L. Hall

Publication date: 14 October 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

projective planecovering designfractional matchingall-to-all comparisonalmost projective plane

Mathematics Subject Classification ID

Hypergraphs (05C65) 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?)
• Maximum degree and fractional matchings in uniform hypergraphs
• Projective planes, coverings and a network problem
• The difference between consecutive primes. II
• The Non-Existence of Finite Projective Planes of Order 10
• An Algorithm for Constructing Hjelmslev Planes
• Combinatorial Designs
• On n-uniform Hjelmslev planes
• The Nonexistence of Certain Finite Projective Planes
• Combinatorial Properties of Group Divisible Incomplete Block Designs

This page was built for publication: Bounds on data limits for all-to-all comparison from combinatorial designs

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