Complementary cycles of any length in regular bipartite tournaments

preprint2021arXivOpen access

Abstract

Let DD be a kk-regular bipartite tournament on nn vertices. We show that, for every pp with 2≤p≤n/2−22 \le p \le n/2-2, DD has a cycle CC of length 2p2p such that D∖CD \setminus C is hamiltonian unless DD is isomorphic to the special digraph F4kF_{4k}. 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=2p=2 and more recently Bai, Li and He gave a proof for p=3p=3 [Y. Bai, H. Li, and W. He. Complementary cycles in regular bipartite tournaments. Discrete Mathematics, 333:14--27, 2014].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.