Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-23T02:36:34.954Z Has data issue: false hasContentIssue false
  • English
  • Français

Indecomposable 1-factorizations of the complete multigraph

Part of: Designs and configurations

Published online by Cambridge University Press:  09 April 2009

Charles J. Colbourn ,
Marlene J. Colbourn  and
Alexander Rosa
Charles J. Colbourn
Affiliation:
Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Marlene J. Colbourn
Affiliation:
Department of Mathematical Sciences, McMaster University, Hamilton, Ontario, L8S 4K1, Canada
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 existence of 1-factorizations of the complete multigraph λKn which cannot be decomposed into 1-factorizations with smaller λ is studied.

MSC classification

Secondary: 05B15: Orthogonal arrays, Latin squares, Room squares
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 39 , Issue 3 , December 1985 , pp. 334 - 343
Copyright
Copyright © Australian Mathematical Society 1985

References

[1]Cameron, P., Parallelisms of complete designs (Cambridge University Press, Cambridge 1976).CrossRefGoogle Scholar
[2]Hartman, A., “Tripling quadruple systems”, Ars Combinatoria 10 (1980), 255–309.Google Scholar
[3]Mendelsohn, E. and Rosa, A., “One-factorizations of the complete graph–a survey”, J. Graph Theory, to appear.Google Scholar
[4]Stern, G. and Lenz, H., “Steiner triple systems with given subspaces; another proof of the Doyen-Wilson theorem”, Boll. Un. Mat. Ital. A (5) 17 (1980), 109–114.Google Scholar
[5]Wallis, W. D., “A tournament problem”, J. Austral. Math. Soc. Ser. B 24 (1983), 289–291.CrossRefGoogle Scholar