C_p-decompositions of some regular graphs
Let \(C_n\) denote the cycle of length \(n\). A \(C_n\)-decomposition of a graph \(X\) is a partition of its edge set so that each part is isomorphic to \(C_n\). A \(C_n\)-factorization of a graph \(X\) is a partition of its edge set into 2-factors \(F_1,F_2,\dots,F_d\) such that each \(F_i\) is a vertex-disjoint union of cycles \(C_n\). Let \(K_{m(n)}\) denote the complete multipartite graph with \(m\) parts each having cardinality \(n\). A long-standing conjecture is that the obvious arithmetical conditions for \(K_{m(n)}\) to admit a \(C_t\)-decomposition are, in fact, sufficient. This paper essentially adresses the conjecture and establishes several nice results. The most striking result is that \(K_{m(n)}\) admits a \(C_p\)-decomposition, where \(p\) is a prime bigger than 10, if and only if \(n(m-1)\) is even and \(p\) divides \(m(m-1)n^2\).
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposition of complete equipartite graphs into paths and cycles of length 2p
- Cyclically decomposing the complete graph into 2-regular graphs
- Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
- Decompositions of complete multipartite graphs into cycles of even length
- C₅-decompositions of the tensor product of complete graphs
- \(C_7\)-decompositions of the tensor product of complete graphs
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Decompositions of complete multipartite graphs into cycles of even length
- Factorizations of product graphs into cycles of uniform length
- scientific article; zbMATH DE number 124520 (Why is no real title available?)
- scientific article; zbMATH DE number 1229616 (Why is no real title available?)
- scientific article; zbMATH DE number 1343531 (Why is no real title available?)
- scientific article; zbMATH DE number 1096962 (Why is no real title available?)
- scientific article; zbMATH DE number 1556758 (Why is no real title available?)
- scientific article; zbMATH DE number 828005 (Why is no real title available?)
- The equipartite Oberwolfach problem with uniform tables
- The Oberwolfach problem and factors of uniform odd length cycles
- The solution of the bipartite analogue of the Oberwolfach problem
- Path and cycle decompositions of complete equipartite graphs: Four parts
- A result on decompositions of regular graphs
- \(C_ n\)-factors of group graphs
- 2p-cycle decompositions of some regular graphs and digraphs
- Sunlet decomposition of certain equipartite graphs
- Pack graphs with subgraphs of size three
- Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
- Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
- Resolvable even cycle decompositions of the tensor product of complete graphs
- \(C_7\)-decompositions of the tensor product of complete graphs
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Multidecompositions of several graph products
- Equipartite gregarious 5-cycle systems and other results
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into short even cycles
- Mutually orthogonal graph squares
- Decompositions of generalized complete graphs
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
- P4-decompositions of regular graphs
- C₄ decomposition of the tensor product of complete graphs
- Decompositions of some classes of regular graphs and digraphs into cycles of length 4p
- scientific article; zbMATH DE number 7478578 (Why is no real title available?)
- Decomposing certain equipartite graphs into sunlet graphs of length \(2p\)
- Decompositions of complete equipartite graphs into cycles of lengths 3 and 6
- Decompositions of some regular graphs into unicyclic graphs of order five
- p^2-cycle decompositions of the tensor product of complete graphs
- Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
- scientific article; zbMATH DE number 7593862 (Why is no real title available?)
- Petersen graph decompositions of complete multipartite graphs
- Primitive cycle decompositions of Kn and Kn−I
- Cyclic cycle systems of the complete multipartite graph
- Almost resolvable even cycle decompositions of ( K_u K_g)()
- Closed trail decompositions of some classes of regular graphs
- Equipartite gregarious 6- and 8-cycle systems
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
This page was built for publication: \(C_{p}\)-decompositions of some regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368932)
