Endomorphism monoids and topological subgraphs of graphs

DOI10.1016/0095-8956(80)90073-8zbMath0437.05029OpenAlexW2094697761MaRDI QIDQ1141150

Ales Pultr, László Babai

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90073-8

zbMATH Keywords

endomorphismsrepresentationpermutation groupfaithfulkittingpseudorealizationsubdivision monoid

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (8)

Towards a characterization of universal categories ⋮ Beyond symmetry in generalized Petersen graphs ⋮ Universal partial order represented by means of oriented trees and other simple graphs ⋮ Finite paths are universal ⋮ Finite paths are universal ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ On monoid graphs ⋮ Finite presentation of homogeneous graphs, posets and Ramsey classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphism groups of graphs and edge-contraction
• Relations (graphs) with given finitely generated semigroups
• Symmetric relations (undirected graphs) with given semigroups
• How comprehensive is the category of semigroups?
• Every finite graph is a full subgraph of a rigid graph
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• Graphs and k-Societies

This page was built for publication: Endomorphism monoids and topological subgraphs of graphs