Large Unavoidable Subtournaments

DOI10.1017/S0963548316000213zbMath1371.05106MaRDI QIDQ5366934

Eoin Long

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

transitive subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Turán theorems for unavoidable patterns

Cites Work

• A new upper bound for diagonal Ramsey numbers
• Unavoidable tournaments
• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Ramsey's theorem - a new lower bound
• Tournaments and colouring
• Dependent random choice
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large Unavoidable Subtournaments