On graphs with a given endomorphism mono
✍
Václav Koubek; Vojtěch Rödl; Benjamin Shemmer
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 241 KB
👁 1 views
## Abstract Hedrlín and Pultr proved that for any monoid **M** there exists a graph __G__ with endomorphism monoid isomorphic to **M**. In this paper we give a construction __G__(__M__) for a graph with prescribed endomorphism monoid **M**. Using this construction we derive bounds on the minimum nu