Resolvable group divisible designs with large groups

zbMath1351.05179MaRDI QIDQ727201

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

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p24

zbMATH Keywords

graph decompositiontransversal designresolvability

Mathematics Subject Classification ID

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

Related Items (1)

A lower bound on HMOLS with equal sized holes

Cites Work

• The asymptotic existence of group divisible designs of large order with index one
• Doubly resolvable designs
• Bipartite decomposition of complete multipartite graphs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Concerning the number of mutually orthogonal latin squares
• 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
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• Asymptotic Existence of Resolvable Graph Designs
• Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
• Two new direct product‐type constructions for resolvable group‐divisible designs
• The Asymptotic Existence of Resolvable Group Divisible Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resolvable group divisible designs with large groups