The monoid of the random graph

DOI10.1007/PL00006009MaRDI QIDQ1576305zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, Dejan Delić

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)

Recommendations

• Random graphs in the monadic theory of order
• On monoid graphs
• Bounded monochromatic components for random graphs
• The Grothendieck constant of random and pseudo-random graphs
• scientific article; zbMATH DE number 168429
• Graphs and ranks of monoids
• Monochromatic cycle partitions in random graphs
• The cofinality of the random graph

Cited in

(12)

• Fraïssé limits in comma categories
• Absolute graphs with prescribed endomorphism monoid
• Minimal functions on the random graph
• The poset of all copies of the random graph has the 2-localization property
• All countable monoids embed into the monoid of the infinite random graph
• The random graph
• MONOTONE INDEPENDENCE, COMB GRAPHS AND BOSE–EINSTEIN CONDENSATION
• scientific article; zbMATH DE number 168429 (Why is no real title available?)
• The endomorphism monoid of the random graph has uncountably many ideals.
• Bounded monochromatic components for random graphs
• Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
• A characterization of retracts in certain Fraïssé limits

This page was built for publication: The monoid of the random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576305)