An application of the Ramsey theorem to ordered r-tournaments

Abstract A known theorem states that there is a function f = f ( k ) such that every tournament T with at least f ( k ) vertices contains a transitive subtournament on k vertices. In this paper, the concept of an ordered r -tournament is introduced and the existence of an analogous function to f = f ( k ) is established.