Resolvable Group Divisible Designs with Large Groups

Peter J. Dukes, Esther R. Lamken, Alan C.H. Ling

Abstract


We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new results on decompositions of complete multipartite graphs into a prescribed graph.


Keywords


Graph decomposition; Resolvability; Transversal design

Full Text: PDF