How much semigroup structure is needed to encode graphs ?

P. Goralčík; A. Goralčíková; V. Koubek

Displaying similar documents to “How much semigroup structure is needed to encode graphs ?”

Equations on the semidirect product of a finite semilattice by a $𝒥$ -trivial monoid of height $k$

F. Blanchet-Sadri (1995)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On universality of semigroup varieties

Marie Demlová, Václav Koubek (2006)

Archivum Mathematicum

Similarity:

A category $K$ is called $α$ -determined if every set of non-isomorphic $K$ -objects such that their endomorphism monoids are isomorphic has a cardinality less than $α$ . A quasivariety $Q$ is called $Q$ -universal if the lattice of all subquasivarieties of any quasivariety of finite type is a homomorphic image of a sublattice of the lattice of all subquasivarieties of $Q$ . We say that a variety $V$ is var-relatively alg-universal if there exists a proper subvariety $W$ of $V$ such that homomorphisms of $V$ whose...

A multiplication of e-varieties of regular $E$ -solid semigroups by inverse semigroup varieties

Martin Kuřil (1997)

Archivum Mathematicum

Similarity:

A multiplication of e-varieties of regular $E$ -solid semigroups by inverse semigroup varieties is described both semantically and syntactically. The associativity of the multiplication is also proved.

Displaying similar documents to “How much semigroup structure is needed to encode graphs ?”

Equations on the semidirect product of a finite semilattice by a 𝒥 -trivial monoid of height k

On universality of semigroup varieties

A multiplication of e-varieties of regular E -solid semigroups by inverse semigroup varieties

Equations on the semidirect product of a finite semilattice by a $𝒥$ -trivial monoid of height $k$

A multiplication of e-varieties of regular $E$ -solid semigroups by inverse semigroup varieties