Skip to main content
SpringerLink
Log in

The Monoid of the Random Graph

  • Published:
Semigroup Forum Aims and scope Submit manuscript

R

. We show that End(R) is not regular and is not generated by its idempotents. The Rees order on the idempotents of End(R) has 2N0 many minimal elements. We also prove that the order type of Q is embeddable in the Rees order of End(R).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Authors
  1. Anthony Bonato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dejan Delic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonato, A., Delic, D. The Monoid of the Random Graph. SemiGroup Forum 61, 138–148 (2000). https://doi.org/10.1007/PL00006009

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00006009

Keywords

Search

Navigation