Yeo's complementary cycle-factor conjecture for regular multipartite tournaments
Yeo's complementary cycle-factor conjecture for regular multipartite tournaments
Let be a regular -partite tournament, with . A -cycle-factor is a cycle-factor consisting of cycles of lengths and . Yeo's conjecture. For every
contains a -cycle-factor. The source recalls that Yeo proved every vertex lies on a cycle of every length from to when , 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
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.