Abstract
A cluster expansion, valid at low densities, is derived for the mean number of clusters in a random mixture of sites or bonds on a graph. It is shown that only clusters without a cut-point (stars) are required, and a number of general theorems for determining the weights are proved.

This publication has 4 references indexed in Scilit: