English

Constructions and uses of incomplete pairwise balanced designs

Combinatorics 2018-09-24 v1

Abstract

We give explicit constructions for incomplete pairwise balanced designs IPBD((v;w),K)((v;w),K), or, equivalently, edge-decompositions of a difference of two cliques KvKwK_v \setminus K_w into cliques whose sizes belong to the set KK. Our constructions produce such designs whenever vv and ww satisfy the usual divisibility conditions, have ratio v/wv/w bounded away from the smallest value in KK minus one, say v/w>k1+ϵv/w > k-1+\epsilon, for k=minKk =\min K and ϵ>0\epsilon>0, and are sufficiently large (depending on KK 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'.

Keywords

Cite

@article{arxiv.1809.07866,
  title  = {Constructions and uses of incomplete pairwise balanced designs},
  author = {Peter J. Dukes and Esther R. Lamken},
  journal= {arXiv preprint arXiv:1809.07866},
  year   = {2018}
}
R2 v1 2026-06-23T04:13:21.710Z