Trees in tournaments
From MaRDI portal
Publication:5957701
DOI10.1016/S0012-365X(00)00463-5zbMath0995.05037MaRDI QIDQ5957701
Publication date: 24 October 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Trees with few leaves in tournaments ⋮ Trees contained in every orientation of a graph ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Trees in tournaments ⋮ Unnamed Item ⋮ Directed Ramsey number for trees ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Trees with three leaves are (\(n+1\))-unavoidable ⋮ Orientation Ramsey Thresholds for Cycles and Cliques
This page was built for publication: Trees in tournaments
