Date
Tue, 21 Feb 2023
Time
14:00 - 15:00
Location
L4
Speaker
Bertille Granet
Organisation
Heidelberg University

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 sufficiently large $n$. Along the way, we also prove several further results, including a conjecture of Liebenau and Pehova on Hamilton decompositions of dense bipartite digraphs.

Please contact us with feedback and comments about this page. Last updated on 16 Feb 2023 16:09.