Smooth digraphs of algebraic length 1 pp-construct all finite structures unless they have a pseudo-loop, yielding the first hardness criterion for infinite directed graph colouring.
Minimal operations over per mutation groups
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.
citing papers explorer
-
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
Smooth digraphs of algebraic length 1 pp-construct all finite structures unless they have a pseudo-loop, yielding the first hardness criterion for infinite directed graph colouring.
-
Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.