Unavoidable trees in tournaments

DOI10.1002/rsa.20765zbMath1397.05073arXiv1609.03393OpenAlexW2963404736MaRDI QIDQ4684833

Richard Mycroft, Tássio Naia

Publication date: 25 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

tournamentstreesdirected graphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Spanning trees of dense directed graphs ⋮ Trees contained in every orientation of a graph ⋮ On the unavoidability of oriented trees ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

This page was built for publication: Unavoidable trees in tournaments