Symmetric relations (undirected graphs) with given semigroups
From MaRDI portal
Publication:2522272
DOI10.1007/BF01297617zbMath0139.24803OpenAlexW1991455246WikidataQ107307787 ScholiaQ107307787MaRDI QIDQ2522272
Publication date: 1965
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/177296
Related Items
On the complexity of H-coloring, Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed, Semigroup theory of symmetry, Homomorphically full graphs, Universality of Small Lattice Varieties, Chromatically optimal rigid graphs, Endomorphism monoids in varieties of commutative semigroups., Graphs with a regular endomorphism monoid, Unnamed Item, Endomorphism monoids and topological subgraphs of graphs, On semigroups of graph endomorphisms, Beyond symmetry in generalized Petersen graphs, Completely rigid graphs, Quotients of rigid graphs, Automorphism groups of posets and lattices with a given subset of fixed points, Quasivarieties of Graphs and Independent Axiomatizability, Endomorphism spectra of graphs, Asymmetric trees with two prescribed degrees, Endomorphisms of undirected modifications of directed graphs, Finite undirected graphs which are not reconstructible from their large cardinality subgraphs, On the number of graphs with a given endomorphism monoid, On some strongly rigid families of graphs and the full embeddings they induce, Automorphism group and category of cospectral graphs, Semigroups of mappings on graphs, Infinite digraphs with given regular automorphism groups, Vector representable matroids of given rank with given automorphism group, Images of rigid digraphs, REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS, Nonconstant continuous maps of spaces and of their \(\beta\)- compactifications, Every finite graph is a full subgraph of a rigid graph, Endomorphisms of graphs. I: The monoid of strong endomorphisms, Automorphism groups of planar graphs. I, On symmetric and antisymmetric relations, On diversity and stability of unit bases for the Euclidean metric, Almost \textit{ff}-universality implies \(Q\)-universality, Representing monoids by mappings preserving equivalences, Full embeddings into some categories of graphs, On a technique for representing semigroups as endomorphism semigroups of graphs with given properties, Almost all graphs are rigid-revisited, A surprising permanence of old motivations (a not-so-rigid story), Some properties of the category of integral domains, Large systems of independent objects in concrete categories. I, Duality theorems for finite structures (characterising gaps and good characterisations), Symmetric graphs and interpretations, Homomorphisms of 3-chromatic graphs, On monoid graphs, Universal topological unary varieties., Gruppenuniversalität und Homogenisierbarkeit
Cites Work
