2000 character limit reached
Surjective polymorphisms of reflexive cycles (2206.11390v2)
Published 22 Jun 2022 in math.CO and cs.CC
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.