Résumé
Let D be a k‐regular bipartite tournament on n vertices. We show that, for every p with 2 ≤ p ≤ n ∕2 − 2, D has a cycle C of length 2p such that D\C is Hamiltonian unless D is isomorphic to the special digraph F k4 . This statement was conjectured by Zhang, Manoussakis and Song. In the same paper, the conjecture was proved for p = 2 and more recently Bai, Li and He gave a proof for p = 3.