Geodesic
Reflexive graphs with near unanimity but no semilattice polymorphisms
Mark Siggers1
1Kyungpook National University
The electronic journal of combinatorics, Tome 25 (2018) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/6196
Classification : 05C75, 08B05, 06A07
Mots-clés : reflexive graph, polymorphism, near unanimity, semilattice

Mark Siggers  1

1 Kyungpook National University 
@article{10_37236_6196,
     author = {Mark Siggers},
     title = {Reflexive graphs with near unanimity but no semilattice polymorphisms},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {4},
     doi = {10.37236/6196},
     zbl = {1401.05253},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6196/}
}
TY  - JOUR
AU  - Mark Siggers
TI  - Reflexive graphs with near unanimity but no semilattice polymorphisms
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6196/
DO  - 10.37236/6196
ID  - 10_37236_6196
ER  - 
%0 Journal Article
%A Mark Siggers
%T Reflexive graphs with near unanimity but no semilattice polymorphisms
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/6196/
%R 10.37236/6196
%F 10_37236_6196
Mark Siggers. Reflexive graphs with near unanimity but no semilattice polymorphisms. The electronic journal of combinatorics, Tome 25 (2018) no. 4. doi: 10.37236/6196

Cité par Sources :