A multigraph counterexample and a low-exposure reduction
Statement
Conjecture 6. 1 9. (Bermond-Thomassen) In a digraph D with δ+
D
≥ 2k − 1, there are k vertex disjoint cycles. Notes: Open for k ≥ 3, and the proof for k = 2 by Thomassen is not intuitive.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.