The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph



G


{\displaystyle G}

and contains information about how the graph is connected. It is denoted by




T

G




{\displaystyle T_{G}}

.
The importance of this polynomial stems from the information it contains about



G


{\displaystyle G}

. Though originally studied in algebraic graph theory as a generalization of counting problems related to graph coloring and nowhere-zero flow, it contains several famous other specializations from other sciences such as the Jones polynomial from knot theory and the partition functions of the Potts model from statistical physics. It is also the source of several central computational problems in theoretical computer science.
The Tutte polynomial has several equivalent definitions. It is essentially equivalent to Whitney’s rank polynomial, Tutte’s own dichromatic polynomial and Fortuin–Kasteleyn’s random cluster model under simple transformations. It is essentially a generating function for the number of edge sets of a given size and number of connected components, with immediate generalizations to matroids. It is also the most general graph invariant that can be defined by a deletion–contraction recurrence. Several textbooks about graph theory and matroid theory devote entire chapters to it.

Definitions
Definition. For an undirected graph



G
=
(
V
,
E
)


{\displaystyle G=(V,E)}

one may define the Tutte polynomial as

T

G


(
x
,
y
)
=

∑

A
⊆
E


(
x
−
1

)

k
(
A
)
−
k
(
E
)


(
y
−
1

)

k
(
A
)
+

|

A

|

−

|

V

|



,


{\displaystyle T_{G}(x,y)=\sum \nolimits _{A\subseteq E}(x-1)^{k(A)-k(E)}(y-1)^{k(A)+|A|-|V|},}

where



k
(
A
)


{\displaystyle k(A)}

denotes the number of connected components of the graph



(
V
,
A
)


{\displaystyle (V,A)}

.
In this definition it is clear that




T

G




{\displaystyle T_{G}}

is well-defined and a polynomial in



x


{\displaystyle x}

and



y


{\displaystyle y}

.
The same definition can be given using slightly different notation by letting



r
(
A
)
=

|

V

|

−
k
(
A
)


{\displaystyle r(A)=|V|-k(A)}

denote the rank of the graph



(
V
,
A
)


{\displaystyle (V,A)}

. Then the Whitney rank generating function is defined as

R

G


(
u
,
v
)
=

∑

A
⊆
E



u

r
(
E
)
−
r
(
A
)



v


|

A

|

−
r
(
A
)


.


{\displaystyle R_{G}(u,v)=\sum \nolimits _{A\subseteq E}u^{r(E)-r(A)}v^{|A|-r(A)}.}

The two functions are equivalent under a simple change of variables:

T

G


(
x
,
y
)
=

R

G


(
x
−
1
,
y
−
1
)
.


{\displaystyle T_{G}(x,y)=R_{G}(x-1,y-1).}

Tutte’s dichromatic polynomial




Q

G




{\displaystyle Q_{G}}

is the result of another simple transformation:

T

G


(
x
,
y
)
=
(
x
−
1

)

−
k
(
G
)



Q

G


(
x
−
1
,
y
−
1
)
.


{\displaystyle T_{G}(x,y)=(x-1)^{-k(G)}Q_{G}(x-1,y-1).}

Tutte’s original definition of




T

G




{\displaystyle T_{G}}

is equivalent but less easily stated. For connected



G


{\displaystyle G}

we set

T

G


(
x
,
y
)
=

∑

i
,
j



t

i
j



x

i



y

j


,


{\displaystyle T_{G}(x,y)=\sum \nolimits _{i,j}t_{ij}x^{i}y^{j},}

where




t

i
j




{\displaystyle t_{ij}}

denotes the number of spanning trees of internal activity



i


{\displaystyle i}

and external activity



j


{\displaystyle j}

. To define these notions, we assume that the set of edges of the graph is totally ordered,




e

1


,

e

2


,
…


{\displaystyle e_{1},e_{2},\dots }

, and suppose given a spanning tree



T


{\displaystyle T}

. An edge




e

i


∈
T


{\displaystyle e_{i}\in T}

is said to be internally active if it is the smallest edge of its fundamental cutset. Dually, an edge




e

i


∉
T


{\displaystyle e_{i}\notin T}

is said to be externally active if it is the smallest edge of its fundamental cycle. The internal activity and external activity of a spanning tree are the numbers of internal and external edges, respectively. Although the specific set of internal and external edges depends on the choice of total order on the edges, the total number




t

i
j




{\displaystyle t_{ij}}

of spanning trees of internal activity



i


{\displaystyle i}

and external activity



j


{\displaystyle j}

is independent of the order chosen. Moreover, this definition of




T

G




{\displaystyle T_{G}}

extends to not-necessarily-connected graphs if we take




t

i
j




{\displaystyle t_{ij}}

to be the number of spanning forests of internal activity



i


{\displaystyle i}

and external activity



j


{\displaystyle j}

, where a "spanning forest" is meant in the sense of a collection of spanning trees, one for each connected component of



G


{\displaystyle G}

.
A third definition uses a deletion–contraction recurrence. The edge contraction



G

/

u
v


{\displaystyle G/uv}

of graph



G


{\displaystyle G}

is the graph obtained by merging the vertices



u


{\displaystyle u}

and



v


{\displaystyle v}

and removing the edge



u
v


{\displaystyle uv}

. We write



G
−
u
v


{\displaystyle G-uv}

for the graph where the edge



u
v


{\displaystyle uv}

is merely removed. Then the Tutte polynomial is defined by the recurrence relation

T

G


=

T

G
−
e


+

T

G

/

e


,


{\displaystyle T_{G}=T_{G-e}+T_{G/e},}

if



e


{\displaystyle e}

is neither a loop nor a bridge, with base case

T

G


(
x
,
y
)
=

x

i



y

j


,


{\displaystyle T_{G}(x,y)=x^{i}y^{j},}

if



G


{\displaystyle G}

contains



i


{\displaystyle i}

bridges and



j


{\displaystyle j}

loops and no other edges. In particular,




T

G


=
1


{\displaystyle T_{G}=1}

if



G


{\displaystyle G}

contains no edges.
The random cluster model from statistical mechanics due to Fortuin & Kasteleyn (1972) provides yet another equivalent definition. The partition sum

Z

G


(
q
,
w
)
=

∑

F
⊆
E



q

k
(
F
)



w


|

F

|





{\displaystyle Z_{G}(q,w)=\sum \nolimits _{F\subseteq E}q^{k(F)}w^{|F|}}

is equivalent to




T

G




{\displaystyle T_{G}}

under the transformation

Z

G




(


(
x
−
1
)
(
y
−
1
)
,

y
−
1


)


.


{\displaystyle T_{G}(x,y)=(x-1)^{-k(E)}(y-1)^{-|V|}\cdot Z_{G}{\Big (}(x-1)(y-1),\;y-1{\Big )}.}

Properties
The Tutte polynomial factors into connected components. If



G


{\displaystyle G}

is the union of disjoint graphs



H


{\displaystyle H}

and




H
′



{\displaystyle H'}

then

T


H
′





{\displaystyle T_{G}=T_{H}\cdot T_{H'}}

Isomorphic graphs have the same Tutte polynomial, but the converse is not true. For example, the Tutte polynomial of every forest on



m


{\displaystyle m}

edges is




x

m




{\displaystyle x^{m}}

.
If



G


{\displaystyle G}

is planar and




G

∗




{\displaystyle G^{*}}

denotes its dual graph then

T

G


(
x
,
y
)
=

T


G

∗




(
y
,
x
)


{\displaystyle T_{G}(x,y)=T_{G^{*}}(y,x)}

In particular, the chromatic polynomial of a planar graph is the flow polynomial of its dual. Tutte refers to such functions as V-functions.

Examples

The figures show two ways of calculating the Tutte polynomial




T

G


=

x

3


+

x

2


+
x
y


{\displaystyle T_{G}=x^{3}+x^{2}+xy}

of a small graph with four nodes and four edges, either via the deletion–contraction formula or by enumeration of spanning trees.
Tutte polynomials are often given in tabular form by listing the coefficients




t

i
j




{\displaystyle t_{ij}}

of




x

i



y

j




{\displaystyle x^{i}y^{j}}

in row



i


{\displaystyle i}

and column



j


{\displaystyle j}

. For example, the Tutte polynomial of the Petersen graph,

36
x



+
120

x

2


+
180

x

3


+
170

x

4


+
114

x

5


+
56

x

6


+
21

x

7


+
6

x

8


+

x

9








+
36
y
+
84

y

2


+
75

y

3


+
35

y

4


+
9

y

5


+

y

6








+
168
x
y
+
240

x

2


y
+
170

x

3


y
+
70

x

4


y
+
12

x

5


y






+
171
x

y

2


+
105

x

2



y

2


+
30

x

3



y

2








+
65
x

y

3


+
15

x

2



y

3








+
10
x

y

4


,






{\displaystyle {\begin{aligned}36x&+120x^{2}+180x^{3}+170x^{4}+114x^{5}+56x^{6}+21x^{7}+6x^{8}+x^{9}\\&+36y+84y^{2}+75y^{3}+35y^{4}+9y^{5}+y^{6}\\&+168xy+240x^{2}y+170x^{3}y+70x^{4}y+12x^{5}y\\&+171xy^{2}+105x^{2}y^{2}+30x^{3}y^{2}\\&+65xy^{3}+15x^{2}y^{3}\\&+10xy^{4},\end{aligned}}}

is given by the following table.

Other example, the Tutte polynomial of the octahedron graph is given by

12



y


2




x


2


+
11

x
+
11

y
+
40



y


3


+
32



y


2


+
46

y
x
+
24

x


y


3


+
52

x


y


2








+
25



x


2


+
29



y


4


+
15



y


5


+
5



y


6


+
6



y


4


x






+
39

y


x


2


+
20



x


3


+


y


7


+
8

y


x


3


+
7



x


4


+


x


5








{\displaystyle {\begin{aligned}&12\,{y}^{2}{x}^{2}+11\,x+11\,y+40\,{y}^{3}+32\,{y}^{2}+46\,yx+24\,x{y}^{3}+52\,x{y}^{2}\\&+25\,{x}^{2}+29\,{y}^{4}+15\,{y}^{5}+5\,{y}^{6}+6\,{y}^{4}x\\&+39\,y{x}^{2}+20\,{x}^{3}+{y}^{7}+8\,y{x}^{3}+7\,{x}^{4}+{x}^{5}\end{aligned}}}

History
The polynomial was introduced by W. T. Tutte in his 1954 paper, "A contribution to the theory of chromatic polynomials" . Tutte’s interest in the deletion–contraction formula started already in his undergraduate days at Trinity College, Cambridge, originally motivated by perfect rectangles and spanning trees. As he wrote in a later account, he often applied the formula in his research and “wondered if there were other interesting functions of graphs, invariant under isomorphism, with similar recursion formulae.” R. M. Foster had already observed that the chromatic polynomial is one such function, and Tutte began to discover more, which he wrote about in a paper published in 1947, "A ring in graph theory". His original terminology for graph invariants that satisfy the deletion–contraction recursion was W-function, and V-function if multiplicative over components. Tutte writes in the later account, “Playing with my W-functions I obtained a two-variable polynomial from which either the chromatic polynomial or the flow-polynomial could be obtained by setting one of the variables equal to zero, and adjusting signs.” Tutte called this function the dichromate, as he saw it as a generalization of the chromatic polynomial to two variables, but it is usually referred to as the Tutte polynomial. In Tutte’s words, “This may be unfair to Hassler Whitney who knew and used analogous coefficients without bothering to affix them to two variables.” (There is “notable confusion” about the terms dichromate and dichromatic polynomial, introduced by Tutte in the earlier 1947 paper, the two differing only slightly by a change of variables.) The generalisation of the Tutte polynomial to matroids was first published by Crapo, though it appears already in Tutte’s thesis.
Independently of the work in algebraic graph theory, Potts began studying the partition function of certain models in statistical mechanics in 1952. The work by Fortuin and Kasteleyn on the random cluster model, a generalisation of the Potts model, provided a unifying expression that showed the relation to the Tutte polynomial.

Specialisations
Evaluating the Tutte polynomial at various points and lines of the



(
x
,
y
)


{\displaystyle (x,y)}

-plane recovers quantities that have been studied in their own right in diverse fields of mathematics and physics, and part of the appeal of the Tutte polynomial thus comes from the unifying framework it provides for analysing these quantities. Here we list various polynomials that can be recovered as specializations of the Tutte polynomial, up to a factor that depends only on the number of components, rank, and/or nullity of a graph.

Chromatic polynomial

The chromatic polynomial can be recovered from the Tutte polynomial by evaluating at



y
=
0


{\displaystyle y=0}

,

χ

G


(
λ
)
=
(
−
1

)


|

V

|

−
k
(
G
)



λ

k
(
G
)



T

G


(
1
−
λ
,
0
)
,


{\displaystyle \chi _{G}(\lambda )=(-1)^{|V|-k(G)}\lambda ^{k(G)}T_{G}(1-\lambda ,0),}

where



k
(
G
)


{\displaystyle k(G)}

denotes the number of connected components of G.
For integer λ the value of chromatic polynomial




χ

G


(
λ
)


{\displaystyle \chi _{G}(\lambda )}

equals the number of vertex colourings of G using a set of λ colours. It is clear that




χ

G


(
λ
)


{\displaystyle \chi _{G}(\lambda )}

does not depend on the set of colours. What is less clear is that it is the evaluation at λ of a polynomial with integer coefficients. To see this, we observe:

If G has n vertices and no edges, then




χ

G


(
λ
)
=

λ

n




{\displaystyle \chi _{G}(\lambda )=\lambda ^{n}}

.
If G contains a loop (a single edge connecting a vertex to itself), then




χ

G


(
λ
)
=
0


{\displaystyle \chi _{G}(\lambda )=0}

.
If e is an edge which is not a loop, then

χ

G


(
λ
)
=

χ

G
−
e


(
λ
)
−

χ

G

/

e


(
λ
)
.


{\displaystyle \chi _{G}(\lambda )=\chi _{G-e}(\lambda )-\chi _{G/e}(\lambda ).}

The three conditions above enable us to calculate




χ

G


(
λ
)


{\displaystyle \chi _{G}(\lambda )}

, by applying a sequence of edge deletions and contractions; but they give no guarantee that a different sequence of deletions and contractions will lead to the same value. The guarantee comes from the fact that




χ

G


(
λ
)


{\displaystyle \chi _{G}(\lambda )}

counts something, independently of the recurrence. In particular,

T

G


(
2
,
0
)
=
(
−
1

)


|

V

|




χ

G


(
−
1
)


{\displaystyle T_{G}(2,0)=(-1)^{|V|}\chi _{G}(-1)}

gives the number of acyclic orientations.

Jones polynomial

Along the hyperbola



x
y
=
1


{\displaystyle xy=1}

, the Tutte polynomial of a planar graph specialises to the Jones polynomial of an associated alternating knot obtained via the medial graph construction. Louis Kauffman has proposed a generalization of the Tutte polynomial for signed graphs, which yields by the medial construction a knot polynomial that specializes to the Jones polynomial as well as to the Kauffman bracket polynomial.

Individual points

(2, 1)

T

G


(
2
,
1
)


{\displaystyle T_{G}(2,1)}

counts the number of forests, i.e., the number of acyclic edge subsets.

(1, 1)

T

G


(
1
,
1
)


{\displaystyle T_{G}(1,1)}

counts the number of spanning forests (edge subsets without cycles and the same number of connected components as G). If the graph is connected,




T

G


(
1
,
1
)


{\displaystyle T_{G}(1,1)}

counts the number of spanning trees.

(1, 2)

T

G


(
1
,
2
)


{\displaystyle T_{G}(1,2)}

counts the number of spanning subgraphs (edge subsets with the same number of connected components as G).

(2, 0)

T

G


(
2
,
0
)


{\displaystyle T_{G}(2,0)}

counts the number of acyclic orientations of G.

(0, 2)

T

G


(
0
,
2
)


{\displaystyle T_{G}(0,2)}

counts the number of strongly connected orientations of G.

(2, 2)

T

G


(
2
,
2
)


{\displaystyle T_{G}(2,2)}

is the number




2


|

E

|





{\displaystyle 2^{|E|}}

where




|

E

|



{\displaystyle |E|}

is the number of edges of graph G.

(0, −2)
If G is a 4-regular graph, then

(
−
1

)


|

V

|

+
k
(
G
)



T

G


(
0
,
−
2
)


{\displaystyle (-1)^{|V|+k(G)}T_{G}(0,-2)}

counts the number of Eulerian orientations of G. Here



k
(
G
)


{\displaystyle k(G)}

is the number of connected components of G.

(3, 3)
If G is the m × n grid graph, then



2

T

G


(
3
,
3
)


{\displaystyle 2T_{G}(3,3)}

counts the number of ways to tile a rectangle of width 4m and height 4n with T-tetrominoes.
If G is a planar graph, then



2

T

G


(
3
,
3
)


{\displaystyle 2T_{G}(3,3)}

equals the sum over weighted Eulerian orientations in a medial graph of G, where the weight of an orientation is 2 to the number of saddle vertices of the orientation (that is, the number of vertices with incident edges cyclicly ordered "in, out, in out").

Potts and Ising models

Define the hyperbola in the xy−plane:

H

2


:

(
x
−
1
)
(
y
−
1
)
=
2
,


{\displaystyle H_{2}:\quad (x-1)(y-1)=2,}

)
,


{\displaystyle Z(\cdot ),}

of the Ising model studied in statistical physics. Specifically, along the hyperbola




H

2




{\displaystyle H_{2}}

the two are related by the equation:

Z
(
G
)
=
2


(

e

−
α


)



|

E

|

−
r
(
E
)




(

4
sinh
⁡
α

)


r
(
E
)



T

G



(

coth
⁡
α
,

e

2
α



)

.


{\displaystyle Z(G)=2\left(e^{-\alpha }\right)^{|E|-r(E)}\left(4\sinh \alpha \right)^{r(E)}T_{G}\left(\coth \alpha ,e^{2\alpha }\right).}

In particular,

(
coth
⁡
α
−
1
)

(


e

2
α


−
1

)

=
2


{\displaystyle (\coth \alpha -1)\left(e^{2\alpha }-1\right)=2}

for all complex α.
More generally, if for any positive integer q, we define the hyperbola:

H

q


:

(
x
−
1
)
(
y
−
1
)
=
q
,


{\displaystyle H_{q}:\quad (x-1)(y-1)=q,}

then the Tutte polynomial determines the partition function of the q-state Potts model. Various physical quantities analysed in the framework of the Potts model translate to specific parts of the




H

q




{\displaystyle H_{q}}

.

Flow polynomial

The flow polynomial studied in combinatorics can be recovered from the Tutte polynomial by evaluating at



x
=
0


{\displaystyle x=0}

. For a connected and undirected graph G and integer k, a nowhere-zero k-flow is an assignment of “flow” values



1
,
2
,
…
,
k
−
1


{\displaystyle 1,2,\dots ,k-1}

to the edges of an arbitrary orientation of G such that the total flow entering and leaving each vertex is congruent modulo k. The flow polynomial




C

G


(
k
)


{\displaystyle C_{G}(k)}

denotes the number of nowhere-zero k-flows. This value is intimately connected with the chromatic polynomial, in fact, if G is a planar graph, the chromatic polynomial of G is equivalent to the flow polynomial of its dual graph




G

∗




{\displaystyle G^{*}}

in the sense that

Theorem (Tutte).

C

G


(
k
)
=

k

−
1



χ


G

∗




(
k
)
.


{\displaystyle C_{G}(k)=k^{-1}\chi _{G^{*}}(k).}

The connection to the Tutte polynomial is given by:

C

G


(
k
)
=
(
−
1

)


|

E

|

−

|

V

|

+
k
(
G
)



T

G


(
0
,
1
−
k
)
.


{\displaystyle C_{G}(k)=(-1)^{|E|-|V|+k(G)}T_{G}(0,1-k).}

Reliability polynomial

The all-terminal reliability polynomial studied in network theory can be recovered from the Tutte polynomial by evaluating at



x
=
1


{\displaystyle x=1}

. For a connected graph G remove every edge with probability p; this models a network subject to random edge failures. Then the reliability polynomial is a function




R

G


(
p
)


{\displaystyle R_{G}(p)}

, a polynomial in p, that gives the probability that every pair of vertices in G remains connected after the edges fail. The connection to the Tutte polynomial is given by

R

G


(
p
)
=
(
1
−
p

)


|

V

|

−
k
(
G
)



p


|

E

|

−

|

V

|

+
k
(
G
)



T

G



(

1
,



1
p




)

.


{\displaystyle R_{G}(p)=(1-p)^{|V|-k(G)}p^{|E|-|V|+k(G)}T_{G}\left(1,{\tfrac {1}{p}}\right).}

Dichromatic polynomial
Tutte also defined a closer 2-variable generalization of the chromatic polynomial, the dichromatic polynomial of a graph. This is

Q

G


(
u
,
v
)
=

∑

A
⊆
E



u

k
(
A
)



v


|

A

|

−

|

V

|

+
k
(
A
)


,


{\displaystyle Q_{G}(u,v)=\sum \nolimits _{A\subseteq E}u^{k(A)}v^{|A|-|V|+k(A)},}

where



k
(
A
)


{\displaystyle k(A)}

is the number of connected components of the spanning subgraph (V,A). This is related to the corank-nullity polynomial by

Q

G


(
u
,
v
)
=

u

k
(
G
)




R

G


(
u
,
v
)
.


{\displaystyle Q_{G}(u,v)=u^{k(G)}\,R_{G}(u,v).}

The dichromatic polynomial does not generalize to matroids because k(A) is not a matroid property: different graphs with the same matroid can have different numbers of connected components.

Related polynomials

Martin polynomial
The Martin polynomial




m



G
→




(
x
)


{\displaystyle m_{\vec {G}}(x)}

of an oriented 4-regular graph






G
→





{\displaystyle {\vec {G}}}

was defined by Pierre Martin in 1977. He showed that if G is a plane graph and







G
→




m




{\displaystyle {\vec {G}}_{m}}

is its directed medial graph, then

T

G


(
x
,
x
)
=

m





G
→




m




(
x
)
.


{\displaystyle T_{G}(x,x)=m_{{\vec {G}}_{m}}(x).}

Algorithms

Deletion–contraction

The deletion–contraction recurrence for the Tutte polynomial,

T

G


(
x
,
y
)
=

T

G
∖
e


(
x
,
y
)
+

T

G

/

e


(
x
,
y
)
,

e

not a loop nor a bridge.



{\displaystyle T_{G}(x,y)=T_{G\setminus e}(x,y)+T_{G/e}(x,y),\qquad e{\text{ not a loop nor a bridge.}}}

immediately yields a recursive algorithm for computing it for a given graph: as long as you can find an edge e that is not a loop or bridge, recursively compute the Tutte polynomial for when that edge is deleted, and when that edge is contracted. Then add the two sub-results together to get the overall Tutte polynomial for the graph.
The base case is a monomial




x

m



y

n




{\displaystyle x^{m}y^{n}}

where m is the number of bridges, and n is the number of loops.
Within a polynomial factor, the running time t of this algorithm can be expressed in terms of the number of vertices n and the number of edges m of the graph,

t
(
n
+
m
)
=
t
(
n
+
m
−
1
)
+
t
(
n
+
m
−
2
)
,


{\displaystyle t(n+m)=t(n+m-1)+t(n+m-2),}

a recurrence relation that scales as the Fibonacci numbers with solution

t
(
n
+
m
)
=


(



1
+


5



2


)


n
+
m


=
O

(

1.6180

n
+
m


)

.


{\displaystyle t(n+m)=\left({\frac {1+{\sqrt {5}}}{2}}\right)^{n+m}=O\left(1.6180^{n+m}\right).}

The analysis can be improved to within a polynomial factor of the number



τ
(
G
)


{\displaystyle \tau (G)}

of spanning trees of the input graph. For sparse graphs with



m
=
O
(
n
)


{\displaystyle m=O(n)}

this running time is



exp
⁡
(
O
(
n
)
)


{\displaystyle \exp(O(n))}

. For regular graphs of degree k, the number of spanning trees can be bounded by

τ
(
G
)
=
O

(


ν

k


n



n

−
1


log
⁡
n

)

,


{\displaystyle \tau (G)=O\left(\nu _{k}^{n}n^{-1}\log n\right),}

where

ν

k


=



(
k
−
1

)

k
−
1




(

k

2


−
2
k

)



k
2


−
1





.


{\displaystyle \nu _{k}={\frac {(k-1)^{k-1}}{(k^{2}-2k)^{{\frac {k}{2}}-1}}}.}

so the deletion–contraction algorithm runs within a polynomial factor of this bound. For example:

ν

5


≈
4.4066.


{\displaystyle \nu _{5}\approx 4.4066.}

In practice, graph isomorphism testing is used to avoid some recursive calls. This approach works well for graphs that are quite sparse and exhibit many symmetries; the performance of the algorithm depends on the heuristic used to pick the edge e.

Gaussian elimination
In some restricted instances, the Tutte polynomial can be computed in polynomial time, ultimately because Gaussian elimination efficiently computes the matrix operations determinant and Pfaffian. These algorithms are themselves important results from algebraic graph theory and statistical mechanics.

T

G


(
1
,
1
)


{\displaystyle T_{G}(1,1)}

equals the number



τ
(
G
)


{\displaystyle \tau (G)}

of spanning trees of a connected graph. This is
computable in polynomial time as the determinant of a maximal principal submatrix of the Laplacian matrix of G, an early result in algebraic graph theory known as Kirchhoff’s Matrix–Tree theorem. Likewise, the dimension of the bicycle space at




T

G


(
−
1
,
−
1
)


{\displaystyle T_{G}(-1,-1)}

can be computed in polynomial time by Gaussian elimination.
For planar graphs, the partition function of the Ising model, i.e., the Tutte polynomial at the hyperbola




H

2




{\displaystyle H_{2}}

, can be expressed as a Pfaffian and computed efficiently via the FKT algorithm. This idea was developed by Fisher, Kasteleyn, and Temperley to compute the number of dimer covers of a planar lattice model.

Markov chain Monte Carlo
Using a Markov chain Monte Carlo method, the Tutte polynomial can be arbitrarily well approximated along the positive branch of




H

2




{\displaystyle H_{2}}

, equivalently, the partition function of the ferromagnetic Ising model. This exploits the close connection between the Ising model and the problem of counting matchings in a graph. The idea behind this celebrated result of Jerrum and Sinclair is to set up a Markov chain whose states are the matchings of the input graph. The transitions are defined by choosing edges at random and modifying the matching accordingly. The resulting Markov chain is rapidly mixing and leads to “sufficiently random” matchings, which can be used to recover the partition function using random sampling. The resulting algorithm is a fully polynomial-time randomized approximation scheme (fpras).

Computational complexity
Several computational problems are associated with the Tutte polynomial. The most straightforward one is

Input: A graph



G


{\displaystyle G}

Output: The coefficients of




T

G




{\displaystyle T_{G}}

In particular, the output allows evaluating




T

G


(
−
2
,
0
)


{\displaystyle T_{G}(-2,0)}

which is equivalent to counting the number of 3-colourings of G. This latter question is #P-complete, even when restricted to the family of planar graphs, so the problem of computing the coefficients of the Tutte polynomial for a given graph is #P-hard even for planar graphs.
Much more attention has been given to the family of problems called Tutte



(
x
,
y
)


{\displaystyle (x,y)}

defined for every complex pair



(
x
,
y
)


{\displaystyle (x,y)}

:

Input: A graph



G


{\displaystyle G}

Output: The value of




T

G


(
x
,
y
)


{\displaystyle T_{G}(x,y)}

The hardness of these problems varies with the coordinates



(
x
,
y
)


{\displaystyle (x,y)}

.

Exact computation

If both x and y are non-negative integers, the problem




T

G


(
x
,
y
)


{\displaystyle T_{G}(x,y)}

belongs to #P. For general integer pairs, the Tutte polynomial contains negative terms, which places the problem in the complexity class GapP, the closure of #P under subtraction. To accommodate rational coordinates



(
x
,
y
)


{\displaystyle (x,y)}

, one can define a rational analogue of #P.
The computational complexity of exactly computing




T

G


(
x
,
y
)


{\displaystyle T_{G}(x,y)}

falls into one of two classes for any



x
,
y
∈

C



{\displaystyle x,y\in \mathbb {C} }

. The problem is #P-hard unless



(
x
,
y
)


{\displaystyle (x,y)}

lies on the hyperbola




H

1




{\displaystyle H_{1}}

or is one of the points

{

(
1
,
1
)
,
(
−
1
,
−
1
)
,
(
0
,
−
1
)
,
(
−
1
,
0
)
,
(
i
,
−
i
)
,
(
−
i
,
i
)
,

(

j
,

j

2



)

,

(


j

2


,
j

)


}

,

j
=

e



2
π
i

3



.


{\displaystyle \left\{(1,1),(-1,-1),(0,-1),(-1,0),(i,-i),(-i,i),\left(j,j^{2}\right),\left(j^{2},j\right)\right\},\qquad j=e^{\frac {2\pi i}{3}}.}

in which cases it is computable in polynomial time. If the problem is restricted to the class of planar graphs, the points on the hyperbola




H

2




{\displaystyle H_{2}}

become polynomial-time computable as well. All other points remain #P-hard, even for bipartite planar graphs. In his paper on the dichotomy for planar graphs, Vertigan claims (in his conclusion) that the same result holds when further restricted to graphs with vertex degree at most three, save for the point




T

G


(
0
,
−
2
)


{\displaystyle T_{G}(0,-2)}

, which counts nowhere-zero Z3-flows and is computable in polynomial time.
These results contain several notable special cases. For example, the problem of computing the partition function of the Ising model is #P-hard in general, even though celebrated algorithms of Onsager and Fisher solve it for planar lattices. Also, the Jones polynomial is #P-hard to compute. Finally, computing the number of four-colorings of a planar graph is #P-complete, even though the decision problem is trivial by the four color theorem. In contrast, it is easy to see that counting the number of three-colorings for planar graphs is #P-complete because the decision problem is known to be NP-complete via a parsimonious reduction.

Approximation
The question of which points admit a good approximation algorithm has been very well studied. Apart from the points that can be computed exactly in polynomial time, the only approximation algorithm known for




T

G


(
x
,
y
)


{\displaystyle T_{G}(x,y)}

is Jerrum and Sinclair’s FPRAS, which works for points on the “Ising” hyperbola




H

2




{\displaystyle H_{2}}

for y > 0. If the input graphs are restricted to dense instances, with degree



Ω
(
n
)


{\displaystyle \Omega (n)}

, there is an FPRAS if x ≥ 1, y ≥ 1.
Even though the situation is not as well understood as for exact computation, large areas of the plane are known to be hard to approximate.

See also
Bollobás–Riordan polynomial
A Tutte–Grothendieck invariant is any evaluation of the Tutte polynomial

Notes

References

External links
"Tutte polynomial", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
Weisstein, Eric W. "Tutte polynomial". MathWorld.
PlanetMath Chromatic polynomial
Steven R. Pagano: Matroids and Signed Graphs
Sandra Kingan: Matroid theory. Many links.
Code for computing Tutte, Chromatic and Flow Polynomials by Gary Haggard, David J. Pearce and Gordon Royle: [1]