Yeo's complementary cycle-factor conjecture for regular multipartite tournaments

Let DD be a regular cc-partite tournament, with c5c\geq 5. 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. Yeo's conjecture. For every

p{3,,V(D)3},p\in\{3,\dots,|V(D)|-3\},

DD contains a (p,V(D)p)(p,|V(D)|-p)-cycle-factor. The source recalls that Yeo proved every vertex lies on a cycle of every length from 33 to V(D)|V(D)| when c5c\geq5, but does not state a resolution of this stronger complementary cycle-factor conjecture.

Sources & referencesView supporting material

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.