T:of trees on n distinct vertices. of sequences of adding directed edges to an empty graph to form a rooted tree From a tree: ·pick a root; pick an order of edges. Tnn(n-1)！ n!Tn
Tn : # of trees on n distinct vertices. # of sequences of adding directed edges to an empty graph to form a rooted tree From a tree: • pick a root; • pick an order of edges. Tn n(n 1)! = n!Tn
T:of trees on n distinct vertices. of sequences of adding directed edges to an empty graph to form a rooted tree From an empty graph: ·add edges one by one
Tn : # of trees on n distinct vertices. # of sequences of adding directed edges to an empty graph to form a rooted tree From an empty graph: • add edges one by one