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?
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?