Relations (graphs) with given finitely generated semigroups
From MaRDI portal
(Redirected from Relations (graphs) with given finitely generated semigroups)
Cited in
(25)- Almost \textit{ff}-universality implies \(Q\)-universality
- Generalized symmetry of graphs - a survey
- A surprising permanence of old motivations (a not-so-rigid story)
- De Morgan algebras are universal
- Endomorphism monoids and topological subgraphs of graphs
- Homomorphisms and principal congruences of bounded lattices. III. The independence theorem
- Universal topological unary varieties.
- Solution to a problem of FitzGerald
- On monoid graphs
- On relatively elementary definability of graph classes in the class of semigroups
- Fractal property of the graph homomorphism order
- Relations (graphs) with given infinite semigroups
- Symmetric relations (undirected graphs) with given semigroups
- On symmetric and antisymmetric relations
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
- Large systems of independent objects in concrete categories. I
- Graphs and ranks of monoids
- scientific article; zbMATH DE number 3305155 (Why is no real title available?)
- Semigroups of mappings on graphs
- Beyond symmetry in generalized Petersen graphs
- On endomorphism universality of sparse graph classes
- On concrete characterization problem of endomorphism semigroups of graphs
- On the minimum order of graphs with given semigroup
- On the number of graphs with a given endomorphism monoid
This page was built for publication: Relations (graphs) with given finitely generated semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394311)