Surjective polymorphisms of reflexive cycles
Combinatorics
2022-07-14 v2 Computational Complexity
Abstract
A reflexive cycle is any reflexive digraph whose underlying undirected graph is a cycle. Call a relational structure Slupecki if its surjective polymorphisms are all essentially unary. We prove that all reflexive cycles of girth at least 4 have this property.
Keywords
Cite
@article{arxiv.2206.11390,
title = {Surjective polymorphisms of reflexive cycles},
author = {Isabelle Larivière and Benoit Larose and David Emmanuel Pazmiño Pullas},
journal= {arXiv preprint arXiv:2206.11390},
year = {2022}
}