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.
The following statement allows us to replicate the correspondi ng proofs from [ 25]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
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.