Abstract :
The random cluster model is an intriguing stochastic model on the vertices and edges of a graph. It contains the ingredients of colouring problems on the vertices and at the same time percolation-type processes on the edge set. Thus it can be regarded as a correlated version of random graph theory. In this paper I relate the model to other more well-known areas of combinatorics.
