4
$\begingroup$

It's well known that almost all graphs are asymmetric (have trivial automorphism group) and that almost all free trees are symmetric.

By which argument do I see whether almost all rooted trees are asymmetric or symmetric?

  • 4
    Did you try adapting the argument for unrooted trees, e.g. as given in http://en.wikipedia.org/wiki/Asymmetric_graph#Trees?2011-04-08

0 Answers 0