The following pages link to Trees in tournaments (Q5917541):
Displaying 19 items.
- A Ramsey type result for oriented trees (Q338566) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Paths with two blocks in \(n\)-chromatic digraphs (Q885298) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Trees with few leaves in tournaments (Q2131862) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- Parity of paths in tournaments (Q2297716) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
- Seymour's second neighborhood conjecture for tournaments missing a generalized star (Q2911055) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q3169283) (← links)
- Onk-ary spanning trees of tournaments (Q4237726) (← links)
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture (Q4521493) (← links)
- Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
- Directed Ramsey number for trees (Q5915808) (← links)
- On the unavoidability of oriented trees (Q5918100) (← links)
- On the unavoidability of oriented trees (Q5918670) (← links)
- Ramsey numbers of sparse digraphs (Q6635126) (← links)
- Trees with many leaves in tournaments (Q6652097) (← links)