Loop conditions for strongly connected digraphs

DOI10.1142/S0218196720500083zbMath1454.08006OpenAlexW2980164315WikidataQ114614801 ScholiaQ114614801MaRDI QIDQ4960455

Miroslav Olšák

Publication date: 16 April 2020

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196720500083

zbMATH Keywords

loop conditionsMaltsev conditionsSiggers term

Mathematics Subject Classification ID

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

Related Items (4)

Topology and Adjunction in Promise Constraint Satisfaction ⋮ Local–global property for G-invariant terms ⋮ Unnamed Item ⋮ Smooth digraphs modulo primitive positive constructability and cyclic loop conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• \(H\)-coloring dichotomy revisited
• On the complexity of H-coloring
• Some very weak identities
• Algebraic logic and universal algebra in computer science. Conference, Ames, Iowa, USA, June 1-4, 1988. Proceedings
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition
• 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 structure of finite algebras
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The weakest nontrivial idempotent equations
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• The shape of congruence lattices
• Classifying the Complexity of Constraints Using Finite Algebras
• Constraint Satisfaction Problems with Infinite Templates

This page was built for publication: Loop conditions for strongly connected digraphs