Hamilton decompositions of regular bipartite tournaments

arXiv2209.02988MaRDI QIDQ6409943FDOQ6409943

Authors: Bertille Granet 

Publication date: 7 September 2022

Abstract: A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be decomposed into Hamilton cycles. We prove this conjecture for all sufficiently large bipartite tournaments. Along the way, we also prove several further results, including a conjecture of Liebenau and Pehova on Hamilton decompositions of dense bipartite digraphs.

This page was built for publication: Hamilton decompositions of regular bipartite tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409943)