A Most General Edge Elimination Polynomial - Thickening of Edges

We consider a graph polynomial ξ (G; x, y, z) introduced by Ilia Averbouch,BennyGodlin, and Johann A.Makowsky (2008). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Klaus Dohmen, Andre Ponitz, and Peter Tittmann (2003). We derive an identity which relates the graph polynomial ξ of a thickened graph (i.e. a graph with each edge replaced by k copies of it) to ξ of the original graph. As a consequence, we observe that at every point (x, y, z), except for points lying within some set of dimension 2, evaluating ξ is #P-hard. Thus, ξ supports Johann A. Makowsky's difficult point conjecture for graph polynomials (2008).

[1]  Johann A. Makowsky,et al.  Complexity of the Bollobás-Riordan Polynomial , 2008, CSR.

[2]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[3]  Johann A. Makowsky,et al.  A Most General Edge Elimination Polynomial , 2008, WG.

[4]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[5]  N. Linial.  Hard enumeration problems in geometry and combinatorics , 1986 .

[6]  Johann A. Makowsky,et al.  From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials , 2008, Theory of Computing Systems.

[7]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[8]  W. T. Tutte.  Graph Theory , 1984 .

[9]  R. Read.  An introduction to chromatic polynomials , 1968 .

[10]  J. Makowsky,et al.  A most general edge elimination graph polynomial , 2007, 0712.3112.

[11]  Peter Tittmann,et al.  A new two-variable generalization of the chromatic polynomial , 2003, Discret. Math. Theor. Comput. Sci..

[12]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Ilia Averbouch,et al.  The Complexity of Multivariate Matching Polynomials , 2007 .

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  Markus Bläser,et al.  On the Complexity of the Interlace Polynomial , 2007, STACS.