The directed Oberwolfach problem with variable cycle lengths: a recursive construction
Suzan Kadri, Mateja \v{S}ajna

TL;DR
This paper introduces a recursive method for constructing solutions to the directed Oberwolfach problem with variable cycle lengths, extending known solutions and addressing many open cases.
Contribution
It presents a new recursive construction technique for the directed Oberwolfach problem, enabling solutions for larger and more complex cycle decompositions.
Findings
Successfully solves many cases of OP* with up to 13 total cycle length sum.
Provides solutions for all two-cycle cases except specific exceptions.
Extends solutions to cases with multiple cycles using recursive methods.
Abstract
The directed Oberwolfach problem OP asks whether the complete symmetric digraph , assuming , admits a decomposition into spanning subdigraphs, each a disjoint union of directed cycles of lengths . We hereby describe a method for constructing a solution to OP given a solution to OP, for some , if certain conditions on are satisfied. This approach enables us to extend a solution for OP into a solution for OP, as well as into a solution for OP, where denotes copies of 2, provided is sufficiently large. In particular, our recursive construction allows us to effectively address the two-table directed Oberwolfach…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · semigroups and automata theory · Finite Group Theory Research
