Tag Archives: endomorphism monoid

Endomorphism monoids of graphs

A monoid is, for me, a set of mappings on a finite domain which is closed under composition and contains the identity mapping. The composition is, of course, associative. Thus, it is “a group without the inverses”. A homomorphism from … Continue reading

Posted in exposition, open problems | Tagged , , , | Leave a comment