On the number of graphs with a given endomorphism monoid

DOI10.1016/j.disc.2009.03.013zbMath1192.05072OpenAlexW2040871428MaRDI QIDQ960940

Vojtěch Rödl, Václav Koubek

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.013

zbMATH Keywords

rigid graphendomorphism monoid of graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Semigroups (20M99)

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimum order of graphs with given semigroup
• Relations (graphs) with given finitely generated semigroups
• Symmetric relations (undirected graphs) with given semigroups
• Any boundable binding category contains a proper class of mutually disjoint copies of itself