Large unavoidable subtournaments

DOI10.1017/S0963548316000213MaRDI QIDQ5366934zbMATH OpenFDO

Authors Eoin Long

Publication date 10 October 2017

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

Full work available at URL https://doi.org/10.1017/S0963548316000213

zbMATH Keywords

transitive subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Large unavoidable subtournaments
• Unavoidable tournaments
• On tournaments free of large transitive subtournaments
• A proof of Sumner's universal tournament conjecture for large tournaments
• On tournaments and their largest transitive subtournaments

Cites work

• A new upper bound for diagonal Ramsey numbers
• Dependent random choice
• scientific article; zbMATH DE number 3719449 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 3221981 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• On a problem of K. Zarankiewicz
• Ramsey's theorem - a new lower bound
• Some remarks on the theory of graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Tournaments and colouring
• Unavoidable patterns
• Unavoidable subgraphs of colored graphs
• Unavoidable tournaments

Cited in

(4)

• Large unavoidable subtournaments
• scientific article; zbMATH DE number 3985259 (Why is no real title available?)
• Turán theorems for unavoidable patterns
• Unavoidable tournaments

This page was built for publication: Large unavoidable subtournaments

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