The following pages link to Unavoidable trees in tournaments (Q4684833):
Displaying 13 items.
- Large unavoidable subtournaments (Q322361) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Trees with three leaves are (\(n+1\))-unavoidable (Q1827852) (← links)
- Unavoidable subtrees (Q1946660) (← links)
- Trees with few leaves in tournaments (Q2131862) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- Trees contained in every orientation of a graph (Q2138584) (← links)
- Trees with three leaves are \((n+1)\)-unavoidable (Q2741508) (← links)
- Trees in tournaments (Q2816100) (← links)
- Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
- On the unavoidability of oriented trees (Q5918100) (← links)
- Trees with many leaves in tournaments (Q6652097) (← links)
- Directed graphs with lower orientation Ramsey thresholds (Q6658478) (← links)