Complementary cycle-factor conjecture for fully regular multipartite tournaments

About 5 years old · traced to

Let DD be a kk-fully regular cc-partite tournament with c≥5c\geq5, meaning that for every pair of distinct partite sets, their induced bipartite tournament is kk-regular. A (p,∣V(D)∣−p)(p,|V(D)|-p)-cycle-factor is a cycle-factor consisting of cycles of lengths pp and ∣V(D)∣−p|V(D)|-p. Fully regular complementary cycle-factor conjecture. For every even pp satisfying

4≤p≤∣V(D)∣−4,4\leq p\leq |V(D)|-4,

DD has a (p,∣V(D)∣−p)(p,|V(D)|-p)-cycle-factor. This is presented as an extension of the paper's results and as a weaker form of Yeo's conjecture; no resolution is supplied.

References

Primary source

Stéphane Bessy and Jocelyn Thiebaut, “Complementary cycles of any length in regular bipartite tournaments”, arXiv:2102.04514 (2021).

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.