The endomorphism monoid of the random graph has uncountably many ideals.

DOI10.1007/s00233-004-0118-0zbMath1058.20053OpenAlexW2080407129MaRDI QIDQ1882669

Igor Dolinka, Dejan Delić

Publication date: 1 October 2004

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-004-0118-0

zbMATH Keywords

random graphendomorphism monoids of graphslattices of ideals of monoids

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Ideal theory for semigroups (20M12) Semigroups of transformations, relations, partitions, etc. (20M20)

Related Items

On automatic homeomorphicity for transformation monoids ⋮ All countable monoids embed into the monoid of the infinite random graph ⋮ Minimal functions on the random graph ⋮ A characterization of retracts in certain Fraïssé limits

This page was built for publication: The endomorphism monoid of the random graph has uncountably many ideals.