Complementary cycle-factor conjecture for fully regular multipartite tournaments
Complementary cycle-factor conjecture for fully regular multipartite tournaments
Let be a -fully regular -partite tournament with , meaning that for every pair of distinct partite sets, their induced bipartite tournament is -regular. A -cycle-factor is a cycle-factor consisting of cycles of lengths and . Fully regular complementary cycle-factor conjecture. For every even satisfying
has a -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.
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.