Endomorphism Monoid of the Random Graph
by
Dejan Delic
Ryerson University
Coauthors: Anthony Bonato (Wilfrid Laurier University)

Erdös and Rényi proved in 1963 a rather surprising result that there is a unique countably infinite random graph. Over the years, there has been much insight into the structure of Aut(R), its automorphism group.

In this talk, we will present some recent results on the properties of the endomorphism monoid of R, obtained in the joint with work with A. Bonato. In particular, we shall discuss the Rees ordering of End(R) which turns out to embed the ordering of the rationals and contains uncountably many minimal elements.

Date received: June 30, 2002

Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caiv-39.