Resolvable Group Divisible Designs with Large Groups
Keywords:
Graph decomposition, Resolvability, Transversal design
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.
Published
2016-11-10
How to Cite
Dukes, P. J., Lamken, E. R., & Ling, A. C. (2016). Resolvable Group Divisible Designs with Large Groups. The Electronic Journal of Combinatorics, 23(4), P4.24. https://doi.org/10.37236/5435
Article Number
P4.24