Weak finiteness conjecture for prescribed numbers of different cycle lengths
Weak finiteness conjecture for prescribed numbers of different cycle lengths
Let be the source's minimum-outdegree threshold for forcing vertex-disjoint directed cycles with different lengths. Weak finiteness conjecture. For every positive integer , if the positive integer is sufficiently large compared with , then
This is proposed as a weaker alternative to Lichiardopol's conjecture on the finiteness of . The source gives no resolution and presents the statement for further research.
Sources & referencesView supporting material
Primary source
Yandong Bai and Wenpei Jia, “Vertex-disjoint cycles of different lengths in tournaments”, arXiv:2403.03692 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.