Complementary cycles of any length in regular bipartite tournaments

From MaRDI portal
Publication:6074575

DOI10.1002/JGT.22914zbMATH Open1522.05156arXiv2102.04514OpenAlexW3128440614MaRDI QIDQ6074575FDOQ6074575


Authors: Stéphane Bessy, Jocelyn Thiebaut Edit this on Wikidata


Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: Let D be a k-regular bipartite tournament on n vertices. We show that, for every p with 2leplen/22, D has a cycle C of length 2p such that DsetminusC is hamiltonian unless D is isomorphic to the special digraph F4k. 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 p=2 and more recently Bai, Li and He gave a proof for p=3 [Y. Bai, H. Li, and W. He. Complementary cycles in regular bipartite tournaments. Discrete Mathematics, 333:14--27, 2014].


Full work available at URL: https://arxiv.org/abs/2102.04514




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Complementary cycles of any length in regular bipartite tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074575)