IMADA - Department of Mathematics and Computer Science |
With J. Thiebaut (U. Montpellier) we proved a conjecture of Zhang, Manoussakis and Song from 1994 asserting that every bipartite regular tournament could be (vertex-)partitionned into two Hamiltonian digraphs with prescribed size. In this talk I will present this result and show how it was a missing case in the context of Hamiltonian decompositions in tournaments and bipartite tournaments. I will also try to survey algorithmic results and questions related to the computation of cycle decompositions in tournaments. Host: Jørgen Bang-Jensen SDU HOME | IMADA HOME | Previous Page Daniel Merkle |