An application of the Ramsey theorem to ordered r-tournaments

✍ Scribed by A Bialostocki

• Publisher: Elsevier Science
• Year: 1986
• Tongue: English
• Weight: 221 KB
• Volume: 61
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(86)90105-6

✦ Synopsis

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.