A partial m=(2k+1)-cycle system of order n can be embedded in an m- cycle of order (2n+1)m
From MaRDI portal
Publication:686159
DOI10.1016/0012-365X(93)90331-MzbMATH Open0789.05006MaRDI QIDQ686159FDOQ686159
Publication date: 12 June 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Triple systems (05B07)
Cites Work
- A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
- Small embeddings for partial cycle systems of odd length
- Embedding Partial Steiner Triple Systems
- On embedding incomplete symmetric Latin squares
- Embedding Latin Squares with Prescribed Diagonal
- Title not available (Why is that?)
- Title not available (Why is that?)
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- Embedding partial Mendelsohn triple systems
Cited In (10)
- Small embeddings for partial 5-cycle systems
- The Doyen-Wilson theorem extended to 5-cycles
- Embedding directed and undirected partial cycle systems of index λ > 1
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- Amalgamations of connected \(k\)-factorizations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On cycle systems with specified weak chromatic number
- Enclosings of \(\lambda \)-fold 4-cycle systems
- Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
This page was built for publication: A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686159)
