## Graphs Admitting k-NU Operations. Part 1: The Reflexive Case

- Tomás Feder, Pavol Hell, Benoit Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
- SIAM J. Discrete Math.
- 2013

@article{Loten2011NearUnanimityPO, title={Near-Unanimity Polymorphisms on Structures with Finite Duality}, author={Cynthia Loten and Claude Tardif}, journal={SIAM J. Discrete Math.}, year={2011}, volume={25}, pages={490-496} }

- Published 2011 in SIAM J. Discrete Math.
DOI:10.1137/080731177

We introduce a combinatorial parameter on finite relational trees, called the degree of monstrosity, which measures the smallest possible arity of a near-unanimity polymorphism on a core structure with finite duality. We also show that the core structures which admit all conservative operations as polymorphisms are essentially the structures with finite… CONTINUE READING