Small embeddings for partial cycle systems of odd length
From MaRDI portal
Publication:2639071
DOI10.1016/0012-365X(90)90247-FzbMath0718.05032MaRDI QIDQ2639071
C. A. Rodger, Douglas R. Stinson, Charles C. Lindner
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On the embedding of partial three path designs, Embedding coverings of 2-paths with 3-paths, The Doyen-Wilson theorem extended to 5-cycles, A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
Cites Work
- Unnamed Item
- Unnamed Item
- Nesting of cycle systems of odd length
- Steiner pentagon systems
- A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- On embedding incomplete symmetric Latin squares
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- Nesting and almost resolvability of pentagon systems
- Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
- Embedding Partial Steiner Triple Systems
