A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)

DOI10.1016/0012-365X(93)90331-MzbMath0789.05006MaRDI QIDQ686159

C. A. Rodger, Charles C. Lindner

Publication date: 12 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

embedding; groupoid; cycle system

Mathematics Subject Classification ID

05B15: Orthogonal arrays, Latin squares, Room squares

20N05: Loops, quasigroups

05B07: Triple systems

Related Items

Embedding directed and undirected partial cycle systems of index λ > 1, The Doyen-Wilson theorem extended to 5-cycles, Amalgamations of connected \(k\)-factorizations., Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding partial Mendelsohn triple systems
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• On embedding incomplete symmetric Latin squares
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Small embeddings for partial cycle systems of odd length
• Embedding Partial Steiner Triple Systems
• Embedding Latin Squares with Prescribed Diagonal