Embedding path designs in 4-cycle systems
A \(G\)-design of order \(n\) is an edge-disjoint decomposition of \(K_n\) into copies of the graph \(G\). A path design \(P(n,s,1)\) is a \(P_s\)-design of order \(n\), where \(P_s\) is the path with \(s\) vertices (and length \(s-1\)). An \(m\)-cycle system is a \(C_m\)-design, where \(C_m\) is the cycle of length \(m\). We say that a path design \(P(v,s,1)\) defined on the vertex set \(\Omega\) is embedded in an \(m\)-cycle system defined on the vertex set \(W\), with \(\Omega \subseteq W\), if the decomposition induced by the vertex set \(\Omega\) starting from the \(m\)-cycle system gives the path design (and isolated vertices). In the current work, for each admissible \(n\), all integers \(v \geq 3\) are determined such that there exists a \(P(v,3,1)\) embedded in a \(4\)-cycle system of order \(n\). This extends earlier results by \textit{S. Milici} and the author [Discrete Math. 208/209, 443-449 (1999; Zbl 0930.05009)], where the additional requirement that the path design be a handcuffed design---meaning that each vertex must belong to the same number of paths---was imposed.
- Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems
- Maximum embedding of an H(v-w,3,1) into a TS(v,)
- Embedding handcuffed designs into a maximum packing of the complete graph with 4-cycles.
- Embedding of a -fold P₃-design into a -fold triple system
- Minimum embedding of balanced \(P_{4}\)-designs into 5-cycle systems.
- scientific article; zbMATH DE number 1289753
- Small embedding of an S₃(2,4,u) into an S_ (2,4,u+w)
- scientific article; zbMATH DE number 6302890
- scientific article; zbMATH DE number 812082
- scientific article; zbMATH DE number 825136
- Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \)
- Embeddings of \(P_{3}\)-designs into bowtie and almost bowtie systems
- Minimum embedding of balanced \(P_{4}\)-designs into 5-cycle systems.
- Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems
- Configurations in 4-cycle systems
- Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs
- Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\)
- On some colouring of 4-cycle systems with specified block colour patterns
- Minimum embedding of Steiner triple systems into (K4-e)-designs. I
- Embedding path designs into kite systems
- Path decompositions which contain no proper subsystems.
- Lower bounds for two-period grooming via linear programming duality
- Grooming for two-period optical networks
- Embedding of E₂-designs into 4-cycle systems
- Maximum embedding of a E₂(v-w,4,1) into a P(v,4,)
- scientific article; zbMATH DE number 5778186 (Why is no real title available?)
- Embedding path designs into a maximum packing of K_n with 4-cycles
- Sampling complete designs
This page was built for publication: Embedding path designs in 4-cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849905)
