|
Organizers |
Embeddings Into the Monoid of the Random Graph
by
Dejan Delic
Ryerson University, Toronto, Canada
Coauthors: Anthony Bonato (Wilfrid Laurier University, Waterloo, Canada) and Igor Dolinka (University of Novi Sad, Novi Sad, Serbia)
In this talk we will sketch the ideas behind the proof that the endomorphism monoid of the random (Rado) graph R is countably universal for the class of semigroups; i.e. that embeds all countable semigroups. Building upon this result, certain algebraic and model-theoretic properties of this will be presented together with the evidence that End(R) satisfies a stronger embedding property in the class of all semigroups.
Date received: February 27, 2003
Copyright © 2003 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 Mathematical Conference Abstracts. Document # cajs-26.