An application of the Ramsey theorem to ordered r-tournaments

DOI10.1016/0012-365X(86)90105-6MaRDI QIDQ1077436zbMATH OpenOpenAlexFDO

Authors Arie Bialostocki

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(86)90105-6

zbMATH Keywords

anti-transitive r- tournamentordered r-tournamenttransitive r-subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Review text

An r-tournament consists of a linearly ordered n-set V and a linear ordering of each of its r-element subsets. The r-tournament is transitive (anti-transitive) if the order of each of its r-element subsets agrees with the ordering of V (agrees with the reverse of the ordering of V). Given an r-tournament with underlying set V and a subset U of V, the r- tournament on U, which assigns the induced order to U and assigns to any r-subset the order it was given as a subset of V, is called an r- subtournament. The main result of this paper is: Theorem. For every two positive integers r and n satisfying \(r\leq n\), there exists a positive integer f(r,n) with the following property: Every ordered r-tournament on f(r,n) vertices either contains a transitive r-subtournament on n vertices or an anti-transitive r-tournament on n vertices.

Recommendations

• On Ramsey-Turán type problems in tournaments
• scientific article; zbMATH DE number 3977027
• scientific article; zbMATH DE number 4181385
• Ramsey numbers for transitive tournaments
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• A Ramsey-Type Theorem for Orderings of a Graph
• Applications of Ramsey theory
• On tournaments of small orders and their applications
• scientific article; zbMATH DE number 978296
• Ramsey-type theorems

Cites work

• Disproof of a conjecture of Erdös and moser on tournaments
• The Voting Problem

Cited in

(11)

• A generalization of rotational tournaments
• On tournaments of small orders and their applications
• Representing posets with k-tournaments
• Transversals of total strict linear orders
• Kings in hypertournaments
• The \(H\)-force set of a hypertournament
• Tighter bounds on directed Ramsey number \(R(7)\)
• scientific article; zbMATH DE number 3977027 (Why is no real title available?)
• scientific article; zbMATH DE number 165072 (Why is no real title available?)
• Rényi ordering of tournaments
• Kings in multipartite hypertournaments

This page was built for publication: An application of the Ramsey theorem to ordered r-tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077436)