Resolvable group divisible designs with large groups
zbMATH Open1351.05179MaRDI QIDQ727201FDOQ727201
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decompositions of edge-colored complete graphs
- Doubly resolvable designs
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- The asymptotic existence of group divisible designs of large order with index one
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Two new direct product‐type constructions for resolvable group‐divisible designs
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Concerning the number of mutually orthogonal latin squares
- Bipartite decomposition of complete multipartite graphs
- Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
- Covering and packing for pairs
- An existence theory for loopy graph decompositions
- Asymptotic Existence of Resolvable Graph Designs
- The Asymptotic Existence of Resolvable Group Divisible Designs
Cited In (3)
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)
