Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
Consider the following very simple counting problems associated with a graph G. Each of these is a special case of the general problem of evaluating the Tutte polynomial of a graph (or matroid) at a particular point of the (x, y)-plane — in other words is a Tutte-Gröthendieck invariant. Other …