Weak finiteness conjecture for prescribed numbers of different cycle lengths

About 2 years old · traced to

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.

References

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.