Trees in tournaments
From MaRDI portal
Publication:5905439
DOI10.1007/BF01206356zbMath0736.05041MaRDI QIDQ5905439
Roland Haeggkvist, Andrew G. Thomason
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)
Related Items (14)
Trees with few leaves in tournaments ⋮ Paths with two blocks in \(n\)-chromatic digraphs ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Trees in tournaments ⋮ Unnamed Item ⋮ Ramsey numbers for tournaments ⋮ Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture ⋮ 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 ⋮ Tournaments and Semicomplete Digraphs ⋮ Orientation Ramsey Thresholds for Cycles and Cliques
Cites Work
This page was built for publication: Trees in tournaments
