Year: 2026
Type: preprint
Abstract: We characterise all (undirected) cacti graphs, and forests of cacti, with an edge-preserving near-unanimity operation, by means of forbidden induced subgraphs. Indeed all such graphs also have an edge-preserving majority operation. We show that said majority can be chosen to be symmetric and explicitly construct it for all forests of cacti without the forbidden induced subgraphs.
Source: arXiv (Cornell University)
Institutions: University of Hertfordshire, Durham University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221795997