Back to Search
Start Over
Surjective polymorphisms of reflexive cycles
- Publication Year :
- 2022
-
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.
- Subjects :
- Mathematics - Combinatorics
Computer Science - Computational Complexity
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2206.11390
- Document Type :
- Working Paper