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

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

Authors

Thomas D. H. Coleman (ORCID: https://orcid.org/0000-0003-2012-4919)
Isaac K. Dilley

Publication Details

Journal: Combinatorial Theory
Published: 2024-09-27
DOI: https://doi.org/10.5070/c64264240
Primary Topic: Rings, Modules, and Algebras
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

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

Thomas D. H. Coleman, Isaac K. Dilley

Sep 27, 2024

Combinatorial Theory

Rings, Modules, and Algebras

article

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

Thomas D. H. Coleman, Isaac K. Dilley

September 27, 2024article en

Abstract

Combinatorial TheoryVol. 4(2)

Openalex Percentile: Top 70%

Rings, Modules, and Algebras

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Every group-embeddable monoid arises as the bimorphism monoid of some graph — Thomas D. H. Coleman, Isaac K. Dilley · Combinatorial Theory (2024) | TGRS Research Map | TGRS