The Monoid of the Random Graph

We investigate properties of the endomorphism monoid of the countable random graph R. We show that End(R) is not regular and is not generated by its idempotents. The Rees order on the idempotents of End(R) has 2^N0 many minimal elements. We also prove that the order type of Q is embeddable in the Rees order of End(R).