The following pages link to Trees in tournaments (Q5905439):
Displaying 14 items.
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Paths with two blocks in \(n\)-chromatic digraphs (Q885298) (← links)
- Trees with three leaves are (\(n+1\))-unavoidable (Q1827852) (← links)
- Trees with few leaves in tournaments (Q2131862) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- (Q2857428) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← 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)
- Trees in tournaments (Q5917541) (← links)
- On the unavoidability of oriented trees (Q5918100) (← links)
- On the unavoidability of oriented trees (Q5918670) (← links)
- Ramsey numbers for tournaments (Q5941503) (← links)