The Asymptotic Existence of Resolvable Group Divisible Designs

DOI10.1002/jcd.21315zbMath1262.05016OpenAlexW1939767867MaRDI QIDQ4921426

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

Publication date: 10 May 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21315

zbMATH Keywords

group divisible designgraph decompositionresolvable designframe design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs ⋮ Graph divisible designs and packing constructions ⋮ The asymptotic existence of frames with a pair of orthogonal frame resolutions ⋮ Resolvable group divisible designs with large groups ⋮ Constructions and uses of incomplete pairwise balanced designs

Cites Work

• The asymptotic existence of group divisible designs of large order with index one
• Asymptotic existence theorems for frames and group divisible designs
• On combinatorial designs with subdesigns
• Doubly resolvable designs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs
• Decompositions of edge-colored complete graphs
• Covering and packing for pairs
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• An existence theory for loopy graph decompositions
• Asymptotic Existence of Resolvable Graph Designs
• Frames with Block Size Four

This page was built for publication: The Asymptotic Existence of Resolvable Group Divisible Designs