The following pages link to Trees in tournaments (Q2816100):
Displaying 6 items.
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Trees with three leaves are (\(n+1\))-unavoidable (Q1827852) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q3169283) (← links)
- Unavoidable trees in tournaments (Q4684833) (← links)
- On avoidable and unavoidable trees (Q4892356) (← links)