On the existence of specified cycles in a tournament

Authors:
Publisher website
Google Scholar
Abstract
For 2 ≦ p ≦n and n ≧ 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p‐ 1 consecutives edges. In this paper, we prove that every tournament of order n ≧ 7 contains D(n, p) for p = 2, 3, …, n. Furthermore, we determine the tournaments of order n, 3 ≦ n ≦ 6, which do not contain D(n, p) for some p.

This publication has 4 references indexed in Scilit: