Complementary cycles of any length in regular bipartite tournaments
Combinatorics
2021-02-10 v1 Discrete Mathematics
Abstract
Let be a -regular bipartite tournament on vertices. We show that, for every with , has a cycle of length such that is hamiltonian unless is isomorphic to the special digraph . This statement was conjectured by Manoussakis, Song and Zhang [K. Zhang, Y. Manoussakis, and Z. Song. Complementary cycles containing a fixed arc in diregular bipartite tournaments. Discrete Mathematics, 133(1-3):325--328,1994]. In the same paper, the conjecture was proved for and more recently Bai, Li and He gave a proof for [Y. Bai, H. Li, and W. He. Complementary cycles in regular bipartite tournaments. Discrete Mathematics, 333:14--27, 2014].
Keywords
Cite
@article{arxiv.2102.04514,
title = {Complementary cycles of any length in regular bipartite tournaments},
author = {Stéphane Bessy and Jocelyn Thiebaut},
journal= {arXiv preprint arXiv:2102.04514},
year = {2021}
}
Comments
22 pages, 5 figures