Jump to ContentJump to Main Navigation
Combinatorics, Complexity, and ChanceA Tribute to Dominic Welsh$
Users without a subscription are not able to see the full content.

Geoffrey Grimmett and Colin McDiarmid

Print publication date: 2007

Print ISBN-13: 9780198571278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198571278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 21 July 2019



Combinatorics, Complexity, and Chance

Geoffrey Grimmett

Oxford University Press

The Tutte polynomial and its relatives play important roles in matroid theory, computational complexity, and models of statistical physics. They provide the natural way to count and relate a variety of objects defined on graphs. This chapter shows that they permit a representation of the two-point correlation function of a ferromagnetic Potts model on a graph G in terms of the flow polynomials of certain related random graphs. This representation extends to general Potts models the so-called random-current expansion for Ising models, and it amplifies the links between the Potts partition function and the Tutte polynomial.

Keywords:   Tutte polynomial, Ising model, ferromagnetic Potts model, random-cluster model, Potts partition function

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .