Resolvable Group Divisible Designs with Large Groups

Electronic Journal Of Combinatorics

Peter J. Dukes¹ 

关键词: Graph decomposition;    Resolvability;    Transversal design;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 streaml

【 授权许可】

Others