Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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?

share|cite|improve this question
Did you try adapting the argument for unrooted trees, e.g. as given in – Pete L. Clark Apr 8 '11 at 14:26

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.