The monoid of the random graph

DOI10.1007/PL00006009zbMath0957.20045OpenAlexW2019621810MaRDI QIDQ1576305

Dejan Delić, Anthony Bonato

Publication date: 21 March 2001

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

Full work available at URL: https://doi.org/10.1007/pl00006009

zbMATH Keywords

minimal idempotentsmonoids of endomorphismscountable linear orderscountable random graphsposets of idempotents

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Semigroups of transformations, relations, partitions, etc. (20M20) Total orders (06A05)

Related Items (5)

Fraïssé limits in comma categories ⋮ Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph ⋮ 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 monoid of the random graph