2022/09/07 by Bertille Granet, Granet, Bertille · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2209.02988
openalex publication_date 2022/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A regular bipartite tournament is an orientation of a complete balanced bipartite graph K2n,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.