Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T09:06:50.561Z Has data issue: false hasContentIssue false

A generalization of Evans' Theorem: embedding partial tricycle systems

Published online by Cambridge University Press:  09 April 2009

C. C. Lindner
Affiliation:
Department of Discrete and Statistical Sciences 120 Mathematics AnnexAuburn University Alabama36849-5307, USA
C. A. Rodger
Affiliation:
Department of Discrete and Statistical Sciences 120 Mathematics AnnexAuburn University Alabama36849-5307, USA
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.

In 1960, Trevor Evans gave a best possible embedding of a partial latin square of order n in a latin square of order t, for any t ≥ 2n. A latin square of order n is equivalent to a 3-cycle system of Kn, n, n, the complete tripartite graph. Here we consider a small embedding of partial 3k-cycle systems of Kn, n, n of a certain type which generalizes Evans' Theorem, and discuss how this relates to the embedding of patterned holes, another recent generalization of Evans' Theorem.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1995

References

[1]Evans, T., ‘Embedding incomplete latin squares’, Amer. Math. Monthly 67 (1960), 958961.Google Scholar
[2]Lindner, C. C. and Rodger, C. A., ‘Generalized embedding theorems for partial latin squares’, Bull. ICA 5 (1992), 8199.Google Scholar
[3]Lindner, C. C. and Rodger, C. A., ‘A partial m = (2k + 1)-cycle system of order n can be embedded in an m-cycle system of order (2n + 1)m’, Discrete Math. 117 (1993), 151159.Google Scholar