On the number of graphs with a given endomorphism monoid

DOI10.1016/J.DISC.2009.03.013MaRDI QIDQ960940zbMATH OpenOpenAlexFDO

Authors Václav Koubek, Vojtěch Rödl

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

endomorphism monoid of graphrigid graph

Mathematics Subject Classification ID

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

Recommendations

• On graphs with a given endomorphism monoid
• On the minimum order of graphs with given semigroup
• Graphs and ranks of monoids
• REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
• (Strong) endomorphism monoids of graphs

Cites work

• Any boundable binding category contains a proper class of mutually disjoint copies of itself
• scientific article; zbMATH DE number 3650785 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• On the minimum order of graphs with given semigroup
• Relations (graphs) with given finitely generated semigroups
• Symmetric relations (undirected graphs) with given semigroups

Cited in

(11)

• The endomorphism monoid of the random graph has uncountably many ideals.
• Absolute graphs with prescribed endomorphism monoid
• REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
• On graphs with a given endomorphism monoid
• Graphs and ranks of monoids
• Bipartite graphs and their endomorphism monoids
• scientific article; zbMATH DE number 6423882 (Why is no real title available?)
• scientific article; zbMATH DE number 6310848 (Why is no real title available?)
• scientific article; zbMATH DE number 6730116 (Why is no real title available?)
• Endomorphism monoids of chained graphs
• On the minimum order of graphs with given semigroup

This page was built for publication: On the number of graphs with a given endomorphism monoid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960940)