The following pages link to (Q3950574):
Displaying 14 items.
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Trees with three leaves are (\(n+1\))-unavoidable (Q1827852) (← links)
- Paths with two blocks in \(k\)-chromatic digraphs (Q1886358) (← links)
- Trees with few leaves in tournaments (Q2131862) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
- Paths and Cycles in Tournaments (Q3734428) (← links)
- Random Trees in Random Graphs (Q3788029) (← links)
- Trees in tournaments (Q5905439) (← 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)
- Trees with many leaves in tournaments (Q6652097) (← links)