Constructions and uses of incomplete pairwise balanced designs

From MaRDI portal
Publication:2334435

DOI10.1007/S10623-019-00645-6zbMATH Open1429.05021arXiv1809.07866OpenAlexW2952812799MaRDI QIDQ2334435FDOQ2334435


Authors: Peter Dukes, Esther R. Lamken Edit this on Wikidata


Publication date: 7 November 2019

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

Abstract: We give explicit constructions for incomplete pairwise balanced designs IPBD((v;w),K), or, equivalently, edge-decompositions of a difference of two cliques KvsetminusKw into cliques whose sizes belong to the set K. Our constructions produce such designs whenever v and w satisfy the usual divisibility conditions, have ratio v/w bounded away from the smallest value in K minus one, say v/w>k1+epsilon, for k=minK and epsilon>0, and are sufficiently large (depending on K and epsilon). As a consequence, some new results are obtained on many related designs, including class-uniformly resolvable designs, incomplete mutually orthogonal latin squares, and group divisible designs. We also include several other applications that illustrate the power of using IPBDs as `templates'.


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Constructions and uses of incomplete pairwise balanced designs

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