We examine how much classical percolation theory on lattices can be extended to arbitrary graphs or even clutters of subsets of a finite set. In the process we get new short proofs of some theorems of J. M. Hammersley. The FKG inequality is used to get an upper bound for the percolation probability and we also derive a lower bound. In each case we characterise when these bounds are attained.