On endomorphism universality of sparse graph classes

Kolja Knauer, Gil Puig i Surroca

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 [J. Comb.~Theory, Ser.~B,…