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
(Redirected from Publication:686159)
A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
Recommendations
Cites work
- scientific article; zbMATH DE number 4081593 (Why is no real title available?)
- scientific article; zbMATH DE number 124520 (Why is no real title available?)
- A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
- Embedding Latin Squares with Prescribed Diagonal
- Embedding Partial Steiner Triple Systems
- Embedding partial Mendelsohn triple systems
- On embedding incomplete symmetric Latin squares
- Small embeddings for partial cycle systems of odd length
- The completion of finite incomplete Steiner triple systems with applications to loop theory
Cited in
(10)- Enclosings of \(\lambda \)-fold 4-cycle systems
- Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
- Embedding directed and undirected partial cycle systems of index λ > 1
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- scientific article; zbMATH DE number 4081593 (Why is no real title available?)
- scientific article; zbMATH DE number 1890841 (Why is no real title available?)
- Amalgamations of connected \(k\)-factorizations.
- Small embeddings for partial 5-cycle systems
- On cycle systems with specified weak chromatic number
- The Doyen-Wilson theorem extended to 5-cycles
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)
