This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence
The Tutte polynomial
β Scribed by Henry H. Crapo
- Publisher
- Springer
- Year
- 1969
- Tongue
- English
- Weight
- 61 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For any matroid M realizable over Q , we give a combinatorial interpretation of the Tutte polynomial T M (x, y) which generalizes many of its known interpretations and specializations, including Tutte's coloring and flow interpretations of T M (1t, 0), T M (0, 1t); Crapo and Rota's finite field inte
The notion of activities with respect to spanning trees in graphs was introduced by W.T. Tutte, and generalized to activities with respect to bases in matroids by H. Crapo. We present a further generalization, to activities with respect to arbitrary subsets of matroids. These generalized activities
## Abstract We define two twoβvariable polynomials for rooted trees and one twoβvariable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determine
Following Crapo [2], let `(x, y)(M)=x r(M) y r(M\*) , where K=Z[x, y]. Lemma 1. `(x, y) &1 =`(&x, &y).