Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reflexive graphs with near unanimity but no semilattice polymorphisms |
scientific article; zbMATH DE number 6968249
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reflexive graphs with near unanimity but no semilattice polymorphisms |
scientific article; zbMATH DE number 6968249 |
Statements
Reflexive graphs with near unanimity but no semilattice polymorphisms (English)
0 references
30 October 2018
0 references
Summary: We show that every generator, in a certain set of generators for the variety of reflexive near unanimity graphs, admits a semilattice polymorphism. We then find a retract of a product of such graphs (paths, in fact) that has no semilattice polymorphism. This verifies for reflexive graphs that the variety of graphs with semilattice polymorpisms does not contain the variety of graphs with near-unanimity, or even \(3\)-ary near-unanimity polymorphisms.
0 references
reflexive graph
0 references
polymorphism
0 references
near unanimity
0 references
semilattice
0 references
