We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial, which generalize an identity for counting connected graphs found by Riordan, Nijenhuis, Wilf and Kreweras and in more general form by Leroux and Gessel, and an identity for the inversion enumerator of trees found by Mallows, Riordan and Kreweras. Finally, we prove a generalization of Mobius inversion on the partition lattice
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, a...
This paper examines several polynomials related to the field of graph theory including the circuit p...
The zonotope of a root system. (English summary) Transform. Groups 13 (2008), no. 3-4, 507–526. The ...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractThe Martin polynomials, introduced by Martin in his 1977 thesis, encode information about th...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The classical relationship between the Tutte polynomial of graph theory and the Potts model of stati...
In this paper, we find recursive formulas for the Tutte polynomials of a family of small-world Farey...
AbstractWe find zero-free regions in the complex plane at large |q| for the multivariate Tutte polyn...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
Konheim and Weiss [2] introduced the concept of parking func-tions of length n in the study of the l...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Using two related parameters, ζ and γ, we extend the recursion for computing the Tutte polynomial of...
The deletion-contraction algorithm is perhaps the most popular method for computing a host of fundam...
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, a...
This paper examines several polynomials related to the field of graph theory including the circuit p...
The zonotope of a root system. (English summary) Transform. Groups 13 (2008), no. 3-4, 507–526. The ...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractThe Martin polynomials, introduced by Martin in his 1977 thesis, encode information about th...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The classical relationship between the Tutte polynomial of graph theory and the Potts model of stati...
In this paper, we find recursive formulas for the Tutte polynomials of a family of small-world Farey...
AbstractWe find zero-free regions in the complex plane at large |q| for the multivariate Tutte polyn...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
Konheim and Weiss [2] introduced the concept of parking func-tions of length n in the study of the l...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Using two related parameters, ζ and γ, we extend the recursion for computing the Tutte polynomial of...
The deletion-contraction algorithm is perhaps the most popular method for computing a host of fundam...
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, a...
This paper examines several polynomials related to the field of graph theory including the circuit p...
The zonotope of a root system. (English summary) Transform. Groups 13 (2008), no. 3-4, 507–526. The ...