Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-24T03:33:45.405Z Has data issue: false hasContentIssue false
  • English
  • Français

Bipackings of pairs into triples, and isomorphism classes of small bipackings

Part of: Designs and configurations

Published online by Cambridge University Press:  09 April 2009

R. G. Stanton ,
M. J. Rogers ,
R. F. Quinn  and
D. D. Cowan
R. G. Stanton
Affiliation:
Department of Computer Science University of Manitoba Winnipeg, CanadaR3T 2N2
M. J. Rogers
Affiliation:
Department of Computer Science University of Manitoba Winnipeg, CanadaR3T 2N2
R. F. Quinn
Affiliation:
Department of Computer Science University of Waterloo Waterloo, CanadaN2L 3G1
D. D. Cowan
Affiliation:
Department of Computer Science University of Waterloo Waterloo, CanadaN2L 3G1
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The (2, 3, ν) bipacking number is determined for all integers ν, and the number of non-isomorphic bipackings is found for small values of ν. The general solution for lambada packings of pairs into triples is deduced from the results for λ = 1 and λ = 2.

MSC classification

Secondary: 05B40: Packing and covering
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 34 , Issue 2 , April 1983 , pp. 214 - 228
Copyright
Copyright © Australian Mathematical Society 1983

References

[1]Billington, E. J. (Morgan), ‘Some small quasi-multiple designs’, Ars Combinatoria 3 (1977), 233–250.Google Scholar
[2]Fort, M. K. and Hedlund, G. A., ‘Minimal coverings of pairs by triples’, Pacific J. Math. 8 (1958), 709–719.CrossRefGoogle Scholar
[3]Ganter, B., Mathon, R. and Rosa, A., ‘A complete census of (10, 3, 2)-block designs and of Mendelsohn triple systems of order 10’, Congressus Numerantium 20 (1977), 383–398.Google Scholar
[4]Mathon, R. and Rosa, A., ‘A census of Mendelsohn triple systems of order 9’, Ars Combinatoria 4 (1977), 309–315.Google Scholar
[5]Stanton, R. G., Bate, J. A. and Mullin, R. C., ‘Isomorphism classes of a set of prime BIBD parameters’, Ars Combinatoria 2 (1976), 251–264.Google Scholar
[6]Stanton, R. G. and Collens, R. J., ‘A computer system for research on the family classification of BIBD's’, Proc. International Congress on Combinatorial Theory, pp. 133–169 (Acad. dei Lincei, Rome 1973).Google Scholar
[7]Stanton, R. G. and Goulden, I. P., ‘Graph factorization, general triple systems, and cyclic triple systems’, Aequationes Math. 22 (1981), 1–28.CrossRefGoogle Scholar
[8]Stanton, R. G. and Kalbfleisch, J. G., ‘Maximal and minimal coverings of (κ − 1)-tuples by κ-tuples’, Pactfic J. Math. 26 (1968). 131–140.Google Scholar
[9]Street, A. P., ‘Some designs with block size three’, Combinatorial Mathematics VII, pp. 224–237 (Lecture Notes in Mathematics 829, Springer-Verlag, 1979).Google Scholar
[10]Wilson, R. M. and Ray-Chaudhuri, D. K., ‘Solution of Kirkman's schoolgirl problem’, Proc. Symposia Pure Math. 19 (1971), 187–203.Google Scholar