Year: 2024
Type: article
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, 20M30Keywords: Infinite graph theory, group-embeddable monoids, bimorphism monoids
Source: Combinatorial Theory
DOI: 10.5070/c64264240
Authors: Thomas D. H. Coleman, Isaac K. Dilley
Institution: University of St Andrews
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4402927916