Wang's arbitrary directed W-cycle-factor conjecture
Let be a digraph of order , and let . An arbitrary -cycle-factor is a collection of disjoint directed cycles realizing a prescribed partition of into parts of size at least .
Wang's conjecture. If , then contains an arbitrary -cycle-factor.
This conjecture generalizes Wang's directed arbitrary cycle-factor conjecture and the graph version for specified vertex sets. Its status is not established in the source.
References
- Yun Wang and Jin Yan, “On directed version of the Sauer-Spender Theorem”, arXiv:2001.11703 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.