On tournaments and their largest transitive subtournaments

DOI10.1007/BF02986687zbMath0811.05029MaRDI QIDQ1343231

Adolfo Sánchez-Flores

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

tournamenttransitive tournamenttransitive subtournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

A note on some embedding problems for oriented graphs ⋮ Design and serial construction of digraph braids ⋮ Tighter bounds on directed Ramsey number \(R(7)\) ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ On the restricted isometry property of the Paley matrix ⋮ Upper bounds on the size of transitive subtournaments in digraphs ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of a theorem of Reid and Parker on tournaments
• Disproof of a conjecture of Erdös and moser on tournaments

This page was built for publication: On tournaments and their largest transitive subtournaments