The local loop lemma

DOI10.1007/s00012-020-0644-yzbMath1458.08005arXiv1902.08791OpenAlexW3007941738WikidataQ124820621 ScholiaQ124820621MaRDI QIDQ2302149

Miroslav Olšák

Publication date: 25 February 2020

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.08791

zbMATH Keywords

digraphlocal loop lemmaTaylor algebra

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Equational logic, Mal'tsev conditions (08B05) Directed graphs (digraphs), tournaments (05C20) Free algebras (08B20)

Cites Work

• Unnamed Item
• Unnamed Item
• \(H\)-coloring dichotomy revisited
• On the complexity of H-coloring
• Loop conditions
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The weakest nontrivial idempotent equations
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• Pseudo‐loop conditions

This page was built for publication: The local loop lemma