4 papers
Connectivity notions on compatible digraphs in equational classes
Gergő Gyenizse, Miklós Maróti, László Zádori
A digraph is called weakly connected, strongly connected, and extremely connected if any two vertices of are connected respectively by an oriented, a direct…
The filter of interpretability types of Hobby-McKenzie varieties is prime
Bertalan Bodor, Gergő Gyenizse, Miklós Maróti +1
We study the Hobby-McKenzie varieties that constitute a major class investigated thoroughly in the monograph The shape of congruence lattices by Kearnes and Kiss. We obtain new cha…
Taylor is prime
Bertalan Bodor, Gergő Gyenizse, Miklós Maróti +1
We study the Taylor varieties and obtain new characterizations of them via compatible reflexive digraphs. Based on our findings, we prove that in the lattice of interpretability ty…
Congruence permutability is prime
Gergő Gyenizse, Miklós Maróti, László Zádori
We give a combinatorial proof that congruence permutability is prime in the lattice of interpretability types of varieties. Thereby, we settle a 1984 conjecture of Garcia and Taylo…