Colouring locally sparse graphs via the hard-core model

We discuss how some well-known results on maximum independent sets and colourings of triangle-free graphs can be proved using the hard-core model from statistical physics. The method can be extended to more general 'local sparsity' conditions where the flexibility of the hard-core model seems to play a more important role than in the special case of triangle-free graphs, which leads to new results.