Semigroups of mappings on graphs

DOI10.1007/BF02572738zbMath0523.20041OpenAlexW1986322439MaRDI QIDQ584533

Vladimir A. Molchanov

Publication date: 1983

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134622

zbMATH Keywords

surveyprojective planesendomorphism semigroupshypergraphscoloring semigroupsdirected transformationsorder graphspartial endomorphismssemigroups of graph mappings

Mathematics Subject Classification ID

Hypergraphs (05C65) Semigroups of transformations, relations, partitions, etc. (20M20) Coloring of graphs and hypergraphs (05C15)

Related Items (23)

Computing automorphisms of semigroups. ⋮ On relatively elementary definability of graph classes in the class of semigroups ⋮ Semigroup theory of symmetry ⋮ On epimorphisms of input symbol semigroups, of universal hypergraphic automata ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ An approach to construct an end-regular graph ⋮ Semigroups of strong endomorphisms of infinite graphs and hypergraphs. ⋮ Elementary definability of the class of universal planar automata in the class of semigroups ⋮ On regularity of semigroups of maps that preserve a binary relation ⋮ Abstract characterization of input symbol semigroups of universal hypergraphic automata ⋮ On Definability of Universal Graphic Automata by Their Input Symbol Semigroups ⋮ Transformation semigroups preserving a binary relation. ⋮ Endomorphism semigroups of 2-nilpotent binary relations. ⋮ Bilateral semidirect products of transformation semigroups ⋮ Standard automata and semidirect products of transformation semigroups ⋮ Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs ⋮ Concrete characterization of universal planar automata ⋮ Catalan monoids, monoids of local endomorphisms, and their presentations ⋮ Frucht theorem for inverse semigroups ⋮ Inverse monoids of graphs ⋮ Various inverses of a strong endomorphism of a graph ⋮ Generalized symmetry of graphs ⋮ Semigroups characterizing hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften
• Products of idempotent order-preserving transformations of arbitrary chains
• Roots of increasing sequences
• Relations (graphs) with given finitely generated semigroups
• On full embeddings of categories of algebras
• Symmetric relations (undirected graphs) with given semigroups
• On the endomorphism semigroup (and category) of bounded lattices
• Ordered sets and their inf-endomorphisms
• On symmetric and antisymmetric relations
• On endomorphisms and partial transformations
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• Products of Idempotent Order-Preserving Transformations
• Graphs with Given Group and Given Graph-Theoretical Properties
• Note on idempotent semigroups, II
• On Rigid Undirected Graphs
• The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
• Products of idempotents in certain semigroups of transformations
• Nonconstant Endomorphisms of Lattices

This page was built for publication: Semigroups of mappings on graphs