Surjective polymorphisms of reflexive cycles

06/22/2022
by   Isabelle Larivière, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2023

Cycles in graphs and in hypergraphs

This is an expository paper. A 1-cycle in a graph is a set C of edges su...
research
04/22/2022

Lengths of Cycles in Generalized Pancake Graphs

In this paper, we consider the lengths of cycles that can be embedded on...
research
08/22/2020

On Cycles of Generalized Collatz Sequences

We explore the cycles and convergence of Generalized Collatz Sequence, w...
research
02/19/2023

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...
research
10/01/2020

On the recursive structure of multigrid cycles

A new non-adaptive recursive scheme for multigrid algorithms is introduc...
research
10/26/2020

Modeling Long Cycles

Recurrent boom-and-bust cycles are a salient feature of economic and fin...
research
05/29/2014

JPEG Noises beyond the First Compression Cycle

This paper focuses on the JPEG noises, which include the quantization no...

Please sign up or login with your details

Forgot password? Click here to reset