On the public citation graph

Relations (graphs) with given finitely generated semigroups

https://doi.org/10.1007/bf01298508
0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.10013openalex-snapshot
A rigid graph for every set
inferred← citeshttps://doi.org/10.1002/jgt.20396openalex-snapshot
On graphs with a given endomorphism monoid
inferred← citeshttps://doi.org/10.1002/jgt.23262openalex-snapshot
On Endomorphism Universality of Sparse Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_118openalex-snapshot
On the Homomorphism Order of Oriented Paths and Trees
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_10openalex-snapshot
Hyperidentities
inferred← citeshttps://doi.org/10.1007/bf01297365openalex-snapshot
On symmetric and antisymmetric relations
inferred← citeshttps://doi.org/10.1007/bf01297617openalex-snapshot
Symmetric relations (undirected graphs) with given semigroups
inferred← citeshttps://doi.org/10.1007/bf01304185openalex-snapshot
Relations (graphs) with given infinite semigroups
inferred← citeshttps://doi.org/10.1007/bf01763170openalex-snapshot
Gruppenuniversalität und Homogenisierbarkeit
inferred← citeshttps://doi.org/10.1007/bf02570800openalex-snapshot
On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
inferred← citeshttps://doi.org/10.1007/bf02572738openalex-snapshot
Semigroups of mappings on graphs
inferred← citeshttps://doi.org/10.1007/bf02944990openalex-snapshot
One-to-one and onto homomorphisms of bounded lattices
inferred← citeshttps://doi.org/10.1007/bf03651379openalex-snapshot
Universal expansions and determinacy for finitely generated varieties of dp-algebras
inferred← citeshttps://doi.org/10.1007/bfb0058650openalex-snapshot
Algebras and relational structures
inferred← citeshttps://doi.org/10.1007/bfb0073121openalex-snapshot
Graphical colour-representation of an inverse semigroup
inferred← citeshttps://doi.org/10.1007/s00009-022-02226-9openalex-snapshot
On monoid graphs
inferred← citeshttps://doi.org/10.1007/s00012-017-0462-zopenalex-snapshot
Homomorphisms and principal congruences of bounded lattices. III. The Independence Theorem
inferred← citeshttps://doi.org/10.1007/s00012-022-00780-7openalex-snapshot
On relatively elementary definability of graph classes in the class of semigroups
inferred← citeshttps://doi.org/10.1007/s00233-019-10049-6openalex-snapshot
On concrete characterization problem of endomorphism semigroups of graphs
inferred← citeshttps://doi.org/10.1007/s00233-021-10170-5openalex-snapshot
Solution to a problem of FitzGerald
inferred← citeshttps://doi.org/10.1007/s10485-007-9122-3openalex-snapshot
Almost ff-universality Implies Q-universality
inferred← citeshttps://doi.org/10.1007/s10801-023-01282-yopenalex-snapshot
Beyond symmetry in generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90113-0openalex-snapshot
De Morgan algebras are universal
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90073-8openalex-snapshot
Endomorphism monoids and topological subgraphs of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90021-2openalex-snapshot
On the minimum order of graphs with given semigroup
inferred← citeshttps://doi.org/10.1016/b978-1-4831-9850-7.50071-0openalex-snapshot
TOPOLOGICAL REPRESENTATION OF SEMIGROUPS
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.055openalex-snapshot
A surprising permanence of old motivations (a not-so-rigid story)
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.027openalex-snapshot
Generalized symmetry of graphs — A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.013openalex-snapshot
On the number of graphs with a given endomorphism monoid
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.017openalex-snapshot
Fractal property of the graph homomorphism order
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0166-8641(02)00103-7openalex-snapshot
Universal topological unary varieties
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70380-5openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0004972700010248openalex-snapshot
Kleene algebras are almost universal
inferred← citeshttps://doi.org/10.1017/s0004972700021031openalex-snapshot
Pseudocomplemented distributive lattices with small endomorphism monoids
inferred← citeshttps://doi.org/10.1017/s1446788700024617openalex-snapshot
Universal varieties of semigroups
inferred← citeshttps://doi.org/10.1080/00927872.2017.1404092openalex-snapshot
Graphs and ranks of monoids
inferred← citeshttps://doi.org/10.1080/713819492openalex-snapshot
Visual Pattern Recognition by Assignment of Invariant Features and Feature-relations
inferred← citeshttps://doi.org/10.1137/070708093openalex-snapshot
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
inferred← citeshttps://doi.org/10.1142/s0218196709005275openalex-snapshot
REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
inferred← citeshttps://doi.org/10.33773/jum.679795openalex-snapshot
ON GENERATED GROUPS
inferred← citeshttps://doi.org/10.3390/sym13071227openalex-snapshot
Connectivity of Semiring Valued Graphs
inferred← citeshttps://doi.org/10.4153/cmb-1971-028-8openalex-snapshot
Some Combinatorial Theorems on Monotonicity
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00856openalex-snapshot
Phylogenetic trees and homomorphisms
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03279openalex-snapshot
Criteria for the less-equal-relation between partial Lovász-vectors of digraphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.