Paper: The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems (at LICS 2025)

Authors: Johanna Brunar Marcin Kozik Tomás Nagy Michael Pinsker

Abstract

No Abstract Available

BibTeX

  @InProceedings{BrunarKozikNagyPins-Thesorrowsofasmooth,
    author = 	 {Johanna Brunar and Marcin Kozik and Tomás Nagy and Michael Pinsker},
    title = 	 {The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems},
    booktitle =  {Proceedings of the Fortieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2025)},
    year =	 {2025},
    month =	 {June}, 
    pages =      {403--416},
    location =   {Singapore}, 
    publisher =	 {ACM}
  }