Constructions and uses of incomplete pairwise balanced designs
Combinatorics
2018-09-24 v1
Abstract
We give explicit constructions for incomplete pairwise balanced designs IPBD, or, equivalently, edge-decompositions of a difference of two cliques into cliques whose sizes belong to the set . Our constructions produce such designs whenever and satisfy the usual divisibility conditions, have ratio bounded away from the smallest value in minus one, say , for and , and are sufficiently large (depending on and ). 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'.
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}
}