The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems

Johanna Brunar, Marcin Kozik, Tomás Nagy, Michael Pinsker. The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. In 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025. pages 403-416, IEEE, 2025. [doi]

Abstract

Abstract is missing.