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

Tom Coleman; Isaac Dilley

doi:10.5070/c64264240

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

Tom Coleman^*, Isaac Dilley

^*Corresponding author for this work

Pure Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Number of pages	15
Journal	Combinatorial Theory
Volume	4
Issue number	2
DOIs	https://doi.org/10.5070/c64264240
Publication status	Published - 30 Sept 2024

Keywords

Infinite graph theory
Group-embeddable monoids
Bimorphism monoids

Access to Document

10.5070/c64264240Licence: CC BY

Coleman_2024_CT_Every-group-embedded-monoid-arises_CC
Copyright 2024 by the author(s).This work is made available under the terms of a Creative Commons Attribution License, available at https://creativecommons.org/licenses/by/4.0/.
Final published version, 488 KBLicence: CC BY

Cite this

@article{2252f8ee8861404d9b2aec63cd902194,

title = "Every group-embeddable monoid arises as the bimorphism monoid of some graph",

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.",

keywords = "Infinite graph theory, Group-embeddable monoids, Bimorphism monoids",

author = "Tom Coleman and Isaac Dilley",

year = "2024",

month = sep,

day = "30",

doi = "10.5070/c64264240",

language = "English",

volume = "4",

journal = "Combinatorial Theory",

issn = "2766-1334",

publisher = "eScholarship University of California",

number = "2",

}

TY - JOUR

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

AU - Coleman, Tom

AU - Dilley, Isaac

PY - 2024/9/30

Y1 - 2024/9/30

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

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

KW - Infinite graph theory

KW - Group-embeddable monoids

KW - Bimorphism monoids

U2 - 10.5070/c64264240

DO - 10.5070/c64264240

M3 - Article

SN - 2766-1334

VL - 4

JO - Combinatorial Theory

JF - Combinatorial Theory

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this