Tutte–Grothendieck invariant

In mathematics, a Tutte–Grothendieck (TG) invariant is a type of graph invariant that satisfies a generalized deletion–contraction formula. Any evaluation of the Tutte polynomial would be an example of a TG invariant.[1][2]

Definition

edit

A graph function f is TG-invariant if:[2]

Above G / e denotes edge contraction whereas G \ e denotes deletion. The numbers c, x, y, a, b are parameters.

Generalization to matroids

edit

The matroid function f is TG if:[1]

It can be shown that f is given by:

where is the value f takes on coloops, is the value f takes on loops, E is the edge set of M; r is the rank function; and

is the generalization of the Tutte polynomial to matroids.

Grothendieck group

edit

The invariant is named after Alexander Grothendieck because of a similar construction of the Grothendieck group used in the Riemann–Roch theorem. For more details see:

References

edit
  1. 1 2 Welsh, Dominic (1999). "The Tutte polynomial". Random Structures & Algorithms. 15 (3–4): 210–228. doi:10.1002/(SICI)1098-2418(199910/12)15:3/4<210::AID-RSA2>3.0.CO;2-R.
  2. 1 2 Goodall, Andrew (2008). "Graph polynomials and Tutte-Grothendieck invariants: an application of elementary finite Fourier analysis". arXiv:0806.4848 [math.CO].