All countable monoids embed into the monoid of the infinite random graph

DOI10.1016/j.disc.2009.03.018zbMath1194.05142OpenAlexW2040440669MaRDI QIDQ960939

Dejan Delić, Igor Dolinka, Anthony Bonato

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.018

zbMATH Keywords

embeddinggraph endomorphisminfinite random graph

Mathematics Subject Classification ID

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

Related Items (5)

A universality result for endomorphism monoids of some ultrahomogeneous structures ⋮ Katětov functors ⋮ On automatic homeomorphicity for transformation monoids ⋮ Remarks on homomorphism-homogeneous lattices and semilattices ⋮ Minimal functions on the random graph

Cites Work

• The monoid of the random graph
• On retracts of the random graph and their natural order
• The endomorphism monoid of the random graph has uncountably many ideals.
• Recursive Unsolvability of a problem of Thue
• The random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: All countable monoids embed into the monoid of the infinite random graph