2 papers
math.CO2026
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…
math.CO2021
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…