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?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
3 years ago