Endomorphism monoids and topological subgraphs of graphs
From MaRDI portal
Publication:1141150
DOI10.1016/0095-8956(80)90073-8zbMath0437.05029MaRDI QIDQ1141150
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
endomorphisms; representation; permutation group; faithful; kitting; pseudorealization; subdivision monoid
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
Finite paths are universal, Finite paths are universal, Finite presentation of homogeneous graphs, posets and Ramsey classes, A surprising permanence of old motivations (a not-so-rigid story), Universal partial order represented by means of oriented trees and other simple graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item