Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
type: Item
instance of: scholarly article
title: Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
zbMATH Open document ID: 0884.05068
DOI: 10.1016/S0012-365X(96)00072-6
author: Darryn Bryant
author: C. A. Rodger
author: Erin R. Spicer
published in: Discrete Mathematics
publication date: 1998-03-08T00:00:00Z
review text: An \(m\)-cycle on a graph \(G\) is a partition of the edges of \(G\) into cycles of length \(m\). The embedding problem for \(m\)-cycle systems asks for the determination of \(S_m(u)\), the set of integers \(v\) so that any \(m\)-cycle system on \(K_u\) can be embedded in an \(m\)-cycle system on \(K_v\). In this paper the authors determine \(S_m(u)\) for \(m \in \{4, 6, 8, 10, 11, 12, 13, 14\}\); \(S_m(u)\) for the other values of \(m \leq 14\) being determined elsewhere. An \(m\)-cycle embedding yields an \(m\)-cycle system on the graph \(K_v - K_u\). However, it is possible to have an \(m\)-cycle system on the graph \(K_v - K_u\) even though there is no \(m\)-cycle system on \(K_u\). The set of values \(u\) and \(v\) for which this is possible is determined for \(m \in \{4, 6, 7, 8, 10, 12, 14\}\).
reviewed by: Katherine Heinrich
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1047079
zbMATH Keywords: \(m\)-cycle system
zbMATH Keywords: embedding
MaRDI profile type: Publication
cites work: Q3872478
cites work: Q5422499
cites work: 5-cycle systems with holes
cites work: The Doyen-Wilson theorem extended to 5-cycles
cites work: On the doyen‐wilson theorem for m‐cycle systems
cites work: Embeddings of Steiner triple systems
cites work: The chromatic index of complete multipartite graphs
cites work: Q4206774
cites work: Q5345646
cites work: Chromatic Numbers for Certain Graphs
cites work: Q3317116
cites work: Q3472130
cites work: On the cyclic decompositions of the complete graph into polygons with odd number of edges
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
cites work: Q3966151
description: scientific article; zbMATH DE number 1047079