Resolvable Group Divisible Designs with Large Groups
| dc.contributor.author | Dukes, Peter J. | |
| dc.contributor.author | Lamken, Esther R. | |
| dc.contributor.author | Ling, Alan C. H. | |
| dc.date.accessioned | 2021-02-09T14:07:16Z | |
| dc.date.available | 2021-02-09T14:07:16Z | |
| dc.date.copyright | 2016 | en_US |
| dc.date.issued | 2016 | |
| dc.description.abstract | 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. | en_US |
| dc.description.reviewstatus | Reviewed | en_US |
| dc.description.scholarlevel | Faculty | en_US |
| dc.identifier.citation | Dukes, P. J., Lamken, E. R., & Ling, A. C. H. (2016). Resolvable Group Divisible Designs with Large Groups. The Electronic Journal of Combinatorics, 24(4). https://doi.org/10.37236/5435 | en_US |
| dc.identifier.uri | https://doi.org/10.37236/5435 | |
| dc.identifier.uri | http://hdl.handle.net/1828/12669 | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.subject | Graph decomposition | en_US |
| dc.subject | Resolvability | en_US |
| dc.subject | Transversal design | en_US |
| dc.title | Resolvable Group Divisible Designs with Large Groups | en_US |
| dc.type | Article | en_US |