Is it known what fraction (almost all?) of graphs have a trivial endomorphism monoid?  I can't seem to find any reference to the question.  Maybe it's related to the question: what fraction of graphs have chromatic number equal to their clique number?