Abstract
Recently the generalized Doyen-Wilson problem of embeddinga 5-cycle system of order u in oneof order v was completely solved. However it isoften useful to solve the more general problem of the existenceof a 5-cycle system of order v witha hole of size u. In this paper we completely solvethis problem.
Similar content being viewed by others
References
D. E. Bryant and C. A. Rodger, On the Doyen-Wilson Theorem for m-cycle systems, J. Combin. Designs, Vol. 2 (1994) pp. 253–271.
D. E. Bryant and C. A. Rodger, The Doyen-Wilson Theorem extended to 5-cycles, J. Combin. Theory Ser. A, Vol. 68 (1994) pp. 218–224.
J. Doyen and R. M. Wilson, Embeddings of Steiner triple systems, Discrete Math, Vol. 5 (1973) pp. 229–239.
D. G. Hoffman and C. A. Rodger, The chromatic index of complete multipartite graphs, J. Graph Theory, Vol. 16 (1992) pp. 159–163.
C. A. Rodger, Problems on cycle systems of odd length, Cong. Numer., Vol. 61 (1988) pp. 5–22.
E. Mendelsohn and A. Rosa, Embedding maximum packings of triples, Cong. Numer., Vol. 40 (1983) pp. 235–247.
G. Stern and A. Lenz, Steiner triple systems with given subspaces; another proof of the Doyen-Wilson theorem, Boll. Un. Mat. Ital. A (5), Vol. 17 (1980) pp. 109–114.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bryant, D.E., Hoffman, D.G. & Rodger, C.A. 5-Cycle Systems with Holes. Designs, Codes and Cryptography 8, 103–108 (1996). https://doi.org/10.1023/A:1018028824093
Issue Date:
DOI: https://doi.org/10.1023/A:1018028824093