Indexed metadata
The majority of a cactus is prickly
Catarina Carvalho, Mathison Knight, Barnaby Martin
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.