2000 character limit reached
Surjective polymorphisms of reflexive cycles
Published 22 Jun 2022 in math.CO and cs.CC | (2206.11390v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.