Semilattice polymorphisms and chordal graphs

We investigate the class of reflexive graphs that admit semilattice polymorphisms, and in doing so, give an algebraic characterisation of chordal graphs. In particular, we show that a graph G is chordal if and only if it has a semilattice polymorphism such that G is a subgraph of the comparability graph of the semilattice. Further, we find a new characterisation of the leafage of a chordal graph in terms of the width of the semilattice polymorphisms it admits. Finally, we introduce obstructions to various types of semilattice polymorphisms, and in doing so, show that the class of reflexive graphs admitting semilattice polymorphisms is not a variety. These are, to our knowledge, the first structural results on graphs with semilattice polymorphisms, beyond the conservative realm.

[1]  Benoît Larose,et al.  A polynomial-time algorithm for near-unanimity graphs , 2005, J. Algorithms.

[2]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[3]  J. B. Nation.  Notes on Lattice Theory , 1998 .

[4]  Pavol Hell,et al.  List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.

[5]  Miklós Maróti,et al.  Reflexive digraphs with near unanimity polymorphisms , 2012, Discret. Math..

[6]  M. Bodirsky.  Constraint Satisfaction : Algorithms and Complexity Course Notes , 2013 .

[7]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[8]  Hans-Jürgen Bandelt,et al.  Graphs with edge-preserving majority functions , 1992, Discret. Math..

[9]  Claude Tardif,et al.  A discrete homotopy theory for binary reflexive structures , 2004 .

[10]  Claude Tardif,et al.  Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case , 2014, SIAM J. Discret. Math..

[11]  R. Ho.  Algebraic Topology , 2022 .

[12]  Andrei A. Krokhin,et al.  Two new homomorphism dualities and lattice operations , 2011, J. Log. Comput..

[13]  Claude Tardif,et al.  Graphs Admitting k-NU Operations. Part 1: The Reflexive Case , 2013, SIAM J. Discret. Math..

[14]  Cynthia Loten.  Retractions of chordal and related graphs , 2003 .

[15]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[16]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[17]  P. Hell,et al.  Absolute Retracts and Varieties of Reflexive Graphs , 1987, Canadian Journal of Mathematics.

[18]  Justin Pearson,et al.  Closure Functions and Width 1 Problems , 1999, CP.

[19]  Erwin Pesch,et al.  Retracts of graphs , 1988 .

[20]  Terry A. McKee,et al.  The leafage of a chordal graph , 1998, Discuss. Math. Graph Theory.

[21]  B. Larose,et al.  Finite posets and topological spaces in locally finite varieties , 2005 .

[22]  Richard C. Brewster,et al.  Near-Unanimity Functions and Varieties of Reflexive Graphs , 2008, SIAM J. Discret. Math..