Weak finiteness conjecture for prescribed numbers of different cycle lengths

Let h(k,)h(k,\ell) be the source's minimum-outdegree threshold for forcing kk vertex-disjoint directed cycles with \ell different lengths. Weak finiteness conjecture. For every positive integer \ell, if the positive integer kk is sufficiently large compared with \ell, then

h(k,) is finite.h(k,\ell)\text{ is finite}.

This is proposed as a weaker alternative to Lichiardopol's conjecture on the finiteness of h(k,k)h(k,k). 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

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.