Thickly-resolvable block designs
| dc.contributor.author | Dukes, Peter J. | |
| dc.contributor.author | Ling, Alan C. H. | |
| dc.contributor.author | Malloch, Amanda | |
| dc.date.accessioned | 2021-02-09T14:07:42Z | |
| dc.date.available | 2021-02-09T14:07:42Z | |
| dc.date.copyright | 2016 | en_US |
| dc.date.issued | 2016 | |
| dc.description.abstract | We show that the necessary divisibility conditions for the existence ofaσ-resolvable BIBD(v,k,λ) are sufficient for largev. The key idea isto form an auxiliary graph based on an [r,k]-configuration withr=σ,and then edge-decompose the completeλ-fold graphK(λ)vinto this graph.As a consequence, we initiate a similar existence theory for incompletedesigns with indexλ | en_US |
| dc.description.reviewstatus | Reviewed | en_US |
| dc.description.scholarlevel | Faculty | en_US |
| dc.identifier.citation | Dukes, P. J., Ling, A. C. H., & Malloch, A. (2016). Thickly-resolvable block designs . The Australasian Journal of Combinatorics, 64(2). https://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p379.pdf | en_US |
| dc.identifier.uri | https://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p379.pdf | |
| dc.identifier.uri | http://hdl.handle.net/1828/12670 | |
| dc.language.iso | en | en_US |
| dc.publisher | The Australasian Journal of Combinatorics | en_US |
| dc.subject.department | Department of Mathematics and Statistics | |
| dc.title | Thickly-resolvable block designs | en_US |
| dc.type | Article | en_US |