A combinatorial property and divisibility graphs of monomial matrix semigroups. (Q706044): Difference between revisions

Assume that \(D\) is a finite directed graph without loops or multiple edges. The divisibility graph \(\text{Div}(S)\) of a semigroup \(S\) has all elements of \(S\) as vertices and all edges \((u,v)\), where \(u\neq v\) and \(u\) divides \(v\). A semigroup \(S\) is \(D\)-saturated if for every infinite subset \(T\) of \(S\), the graph \(\text{Div}(S)\) has a subgraph isomorphic to \(D\) with all vertices being in \(T\). The author describes all pairs \((D,S)\) in terms of divisibility graphs, where \(S\) is a monomial matrix epigroup (or a strong \(\pi\)-regular monomial matrix semigroup) and \(D\)-saturated.