On endomorphism universality of sparse graph classes.

We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best-possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids amo...

Descripción completa

Detalles Bibliográficos
Autores: Knauer, Kolja, Puig i Surroca, G.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2025
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:2445/227127
Acceso en línea:https://hdl.handle.net/2445/227127
Access Level:acceso abierto
Palabra clave:Isomorfismes (Matemàtica)
Teoria de grafs
Representacions de semigrups
Isomorphisms (Mathematics)
Graph theory
Representations of semigroups
Descripción
Sumario:We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best-possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by-product, we prove that monoids can be represented by graphs of bounded expansion (reproving a result of Nešetřil and Ossona de Mendez) and $k$-cancellative monoids can be represented by graphs of bounded degree. Finally, we show that not all completely regular monoids can be represented by graphs excluding topological minor (strengthening a result of Babai and Pultr).