Seymour’s openly disjoint cycles problem
For every positive integer and every finite -regular digraph , let be the maximum cardinality of a collection of directed cycles in that all contain a common vertex and are pairwise openly disjoint, meaning that any two cycles have no common vertex other than that common vertex. Seymour's problem asks whether for every such .
References
- New results on openly disjoint cycles in regular digraphs — arXiv — Bin Chen, Wenshen Wu, Meishaung Chen
Source: arXiv
Progress summary
A new paper improves the bounds and finds counterexamples in degrees six and seven, while the main growth question remains open.
Seymour posed the equality question in 2005: whether every -regular digraph has . The general equality fails in all degrees , but degrees and remain unresolved.
Known results
- : trivial.
- : positive result of Thomassen.
- : positive result of Mader (2009).
- Steiner established , implying .
October 2026 improved bounds and counterexamples
Bin Chen, Wenshen Wu, and Meishuang Chen claim - and -regular counterexamples with and , respectively. They also claim
so the limiting ratio lies between and ; determining it remains open.
Current status (as of November 2026): The equality question is settled negatively for and by the cited results, while and the limiting ratio remain open; the new claims are unverified.
Sources
Solutions 0
No solutions have been posted yet.