Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs
Abstract
We define a class of infinite undirected graphs and a class of infinite $n$-regular hypergraphs and prove that any semigroup of all strong endomorphisms of the graphs and hypergraphs from these classes is isomorphic to the wreath product of a transformation monoid and a small category. We establish the criterional conditions for the regularity of the semigroup of strong endomorphisms of infinite $n$-regular hypergraphs.Downloads
Published
25.06.2013
Issue
Section
Research articles