The unique-obstruction conjecture for Hamilton decompositions of regular tripartite tournaments

Let nn be sufficiently large, and let GG be a regular tripartite tournament on 3n3n vertices. Denote by T{\mathcal T}_\triangle the known regular tripartite tournament obtained from C3(n)\overrightarrow{C_3}(n) by reversing the edges of a single triangle. Unique-obstruction conjecture. Every regular tripartite tournament on 3n3n vertices, except for T{\mathcal T}_\triangle, has a Hamilton decomposition. This conjecture identifies the sole known obstruction to Hamilton decompositions in regular tripartite tournaments; the paper's main theorem proves an almost-decomposition result, while the conjecture itself remains open.

Sources & referencesView supporting material

Primary source

Francesco Di Braccio, Joanna Lada, Viresh Patel, Yani Pehova and Jozef Skokan, “Hamilton decompositions of regular tripartite tournaments”, arXiv:2507.12460 (2025).

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.