An application of the Ramsey theorem to ordered r-tournaments

DOI10.1016/0012-365X(86)90105-6zbMath0595.05053OpenAlexW2071283792MaRDI QIDQ1077436

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

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

Related Items (5)

Kings in hypertournaments ⋮ A generalization of rotational tournaments ⋮ Kings in multipartite hypertournaments ⋮ The \(H\)-force set of a hypertournament ⋮ Representing posets with \(k\)-tournaments

Cites Work

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

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