Arborescence (graph theory)

An arborescence is a rooted oriented tree whose edges all point away from its root. Reversing every edge gives an in-arborescence. An $n$-vertex arborescence embeds in every tournament on $2n-2$ vertices: repeatedly extend an outward leaf in a half-sparse median-order embedding. Reversal gives the analogous existence statement for in-arborescences.