Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T09:22:41.099Z Has data issue: false hasContentIssue false

Graph varieties containing Murskii's groupoid

Published online by Cambridge University Press:  17 April 2009

R. Pöschel
Affiliation:
Karl-Weierstrass-Institut für Mathematik, Akademie der Wissenschaften der DDR, Mohrenstr. 39 (Postfach 1304), Berlin, DDR-1086, German Democratic Republic.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1989