Large unavoidable subtournaments

DOI10.1016/j.endm.2015.06.098zbMath1346.05096arXiv1502.05187OpenAlexW2963899860MaRDI QIDQ322361

Eoin Long

Publication date: 14 October 2016

Full work available at URL: https://arxiv.org/abs/1502.05187

zbMATH Keywords

Ramsey theorytournamentextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

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

This page was built for publication: Large unavoidable subtournaments