Resolvable group divisible designs with large groups

MaRDI QIDQ727201zbMATH OpenFDO

Authors Peter 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph decompositionresolvabilitytransversal design

Mathematics Subject Classification ID

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

Review text

Summary: 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.

Recommendations

• The asymptotic existence of resolvable group divisible designs
• Existence of resolvable group divisible designs with block size four. I
• Resolvable group divisible designs with block size four and group size six
• Two new direct product‐type constructions for resolvable group‐divisible designs
• Resolvable group divisible designs with block size 3

Cites work

• An existence theory for loopy graph decompositions
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Asymptotic Existence of Resolvable Graph Designs
• Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
• Bipartite decomposition of complete multipartite graphs
• Concerning the number of mutually orthogonal latin squares
• Covering and packing for pairs
• Decompositions of edge-colored complete graphs
• Doubly resolvable designs
• scientific article; zbMATH DE number 3487460 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 653238 (Why is no real title available?)
• scientific article; zbMATH DE number 917328 (Why is no real title available?)
• scientific article; zbMATH DE number 5239169 (Why is no real title available?)
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• The asymptotic existence of group divisible designs of large order with index one
• The asymptotic existence of resolvable group divisible designs
• Two new direct product‐type constructions for resolvable group‐divisible designs

Cited in

(4)

• A lower bound on HMOLS with equal sized holes
• Existence of resolvable H-designs with group sizes 2, 3, 4 and 6
• Resolvable G-designs of order v and index {\lambda}
• scientific article; zbMATH DE number 4070907 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727201)