The directed Oberwolfach problem with variable cycle lengths: a recursive construction
The authors consider a digraph variation of the well-known Oberwolfach problem proposed by Ringel. The complete symmetric digraph \(K^{\ast}_n\) is the digraph obtained from a set of \(n\) vertices by adding, for every pair of vertices, edges in both directions. A decomposition of a digraph \(G\) into copies of a digraph \(F\) is an edge-disjoint collection of copies of \(F\) in \(G\) which use every edge of \(G\). The directed Oberwolfach problem aims to decompose \(K^{\ast}_n\) into copies of \(F\), where \(F\) is a vertex-disjoint union of directed cycles of lengths \(m_1, \dots, m_k\), such that \(m_1+\dots +m_k=n\). In such a case, the authors say that \(\operatorname{OP}^{\ast}(m_1, \dots, m_k)\) has a solution.\N\NThe authors make progress in the problem by showing that, in some situations, solutions of the problem for smaller instances can be combined to create solutions for larger instances. For instance, their Theorem 1.5. shows that if \(m_1, \dots, m_k\) are even positive integers such that \(m_1+\dots +m_\ell = m_{\ell+1}+\dots +m_k\), then the existence of a solution for \(\operatorname{OP}^{\ast}(m_1, \dots, m_\ell)\) and a solution for \(\operatorname{OP}^{\ast}(m_{\ell+1}, \dots, m_k)\) implies the existence of a solution for \(\operatorname{OP}^{\ast}(m_1, \dots, m_k)\). The authors then proceed to show other results in a similar vein, also allowing in some situations where \(m_i\) can take odd values. The proofs are fully constructive and use known results together with algebraic techniques.
- A complete solution to the two-table Oberwolfach problems
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Completing the solution of the directed Oberwolfach problem with cycles of equal length
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two
- Hamiltonian decomposition of Cayley graphs of degree 4
- scientific article; zbMATH DE number 5917757 (Why is no real title available?)
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 2148767 (Why is no real title available?)
- Merging combinatorial design and optimization: the Oberwolfach problem
- On a variation of the Oberwolfach problem
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- On the directed Oberwolfach problem with equal cycle lengths
- On the directed Oberwolfach Problem with equal cycle lengths: the odd case
- Resolution of the Oberwolfach problem
- Resolvable decomposition of K^*_n
- Resolvable Mendelsohn designs with block size 4
- Solutions to the Oberwolfach problem for orders up to 100
- Some observations on the oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The Oberwolfach problem and factors of uniform odd length cycles
- Two-factorisations of complete graphs of orders fifteen and seventeen
- Two-factorizations of small complete graphs
This page was built for publication: The directed Oberwolfach problem with variable cycle lengths: a recursive construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6978952)
