A short proof of a theorem of Reid and Parker on tournaments

DOI10.1007/BF02986686zbMath0811.05028OpenAlexW2004184279MaRDI QIDQ1343229

Víctor Neumann-Lara

Publication date: 1 February 1995

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

Full work available at URL: https://doi.org/10.1007/bf02986686

zbMATH Keywords

tournamenttransitive subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

On tournaments and their largest transitive subtournaments ⋮ Design and serial construction of digraph braids ⋮ On the feedback number of 3-uniform linear extremal hypergraphs ⋮ Feedback Vertex Sets in Tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• The 3 and 4-dichromatic tournaments of minimum order
• The Voting Problem
• Disproof of a conjecture of Erdös and moser on tournaments

This page was built for publication: A short proof of a theorem of Reid and Parker on tournaments