Abstract
In this paper varieties are investigated which are generated by graph algebras of undirected graphs and—in most cases—contain Murskii's groupoid (that is the graph algebra of the graph with two adjacent vertices and one loop). Though these varieties are inherently nonfinitely based, they can be finitely based as graph varieties (finitely graph based) like, for example, the varitey generated by Murskii's groupoid. Many examples of nonfinitely based graph varities containing Murskii's groupoid are given, too. Moreover, the coatoms in the subvariety lattice of the graph variety of all undirected graphs are described. There are two coatoms and they are finitely graph based.
Publisher
Cambridge University Press (CUP)
Reference15 articles.
1. Embeddings and absolute retracts of relational systems;Pouzet;CRM-1265,1985
2. Classes of graphs definable by graph algebra identities or quasi-identities;Pöschel;Comment. Math. Univ. Carolin.,1987
3. On the variety generated by Murskii's algebra
4. Murskii's algebra does not satisfy min
5. Varieties that make one Cross