On the existence of specified cycles in bipartite tournaments

Abstract: For two integers

n g e q 3

and

2 l e q p l e q n

, we denote

D (n, p)

the digraph obtained from a directed

n

-cycle by changing the orientations of

p - 1

consecutive arcs. In this paper, we show that a family of

k

-regular

(k g e q 3)

bipartite tournament

B T_{4 k}

contains

D (4 k, p)

for all

2 l e q p l e q 4 k

unless

B T_{4 k}

is isomorphic to a digraph

D

such that

(1, 2, 3, ..., 4 k, 1)

is a Hamilton cycle and

(4 m + i - 1, i) i n A (D)

and

(i, 4 m + i + 1) i n A (D)

, where

1 l e q m l e q k - 1

.

Recommendations

Cited In (8)

This page was built for publication: On the existence of specified cycles in bipartite tournaments