Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
DOI10.1142/S0218196721500442zbMath1502.08004arXiv1906.05699OpenAlexW3173701534MaRDI QIDQ4958331
Albert Vucaj, Florian Starke, Manuel Bodirsky
Publication date: 7 September 2021
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.05699
smooth digraphsloop conditionsdirected cyclesminor-preserving mapsheight 1 identitiesprimitive positive constructions
Paths and cycles (05C38) Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- Unnamed Item
- \(H\)-coloring dichotomy revisited
- Congruence modularity implies cyclic terms for finite algebras
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- The wonderland of reflections
- Taylor's modularity conjecture and related problems for idempotent varieties
- Complexity of tree homomorphisms
- Loop conditions
- Two-element structures modulo primitive positive constructability
- CSP DICHOTOMY FOR SPECIAL POLYADS
- CSP dichotomy for special triads
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- Free Completely Distributive Lattices
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Duality and Polynomial Testing of Tree Homomorphisms
- Loop conditions for strongly connected digraphs
- Algebraic approach to promise constraint satisfaction
This page was built for publication: Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
