Embedding directed and undirected partial cycle systems of index λ > 1

DOI10.1002/jcd.3180010203zbMath0818.05029OpenAlexW2058692994MaRDI QIDQ4698399

C. A. Rodger, Charles C. Lindner

Publication date: 4 May 1995

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180010203

zbMATH Keywords

embeddings\(m\)-cycle systemspartial cycle systems

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

The Doyen-Wilson theorem extended to 5-cycles ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Embedding partial 4-cycle systems of arbitrary index

Cites Work

• A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
• Linear spaces with many small lines
• Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1

This page was built for publication: Embedding directed and undirected partial cycle systems of index λ > 1