CONGRUENCE LATTICE OF A GRAPH

A Buldas · Proceedings of the Estonian Academy of Sciences Physics Mathematics · 1997

A radical map in the class of all graphs (not necessarily finite or undirected) is defined and a complete characterization of the corresponding semisimple graphs is given.It is proved that the congruence lattice of a finite graph satisfies the Jordan-Dedekind chain condition.

Read the paper · More papers on PaperTik