Skip to main content
eScholarship
Open Access Publications from the University of California

Combinatorial Theory

Combinatorial Theory banner

Every group-embeddable monoid arises as the bimorphism monoid of some graph

Published Web Location

https://doi.org/10.5070/C64264240Creative Commons 'BY' version 4.0 license
Abstract

Generalizing results of Frucht and de Groot/Sabidussi, we demonstrate that every group-embeddable monoid is isomorphic to the bimorphism monoid of some graph.

Mathematics Subject Classifications: 05C63, 20M30

Keywords: Infinite graph theory, group-embeddable monoids, bimorphism monoids

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View