加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本