Note on the number of monoids of order $n$
Vácłav Koubek, Vojtěch Rödl · Czech digital mathematics library · 1985
We derive upper hounds for the number of monoids with n elements* As a consequence, we obtain that almost all nelement monoids are endomorphism monoids of graphs with en logp & vertices for some constant c>0* %