Abstract: Let G be an infinite connected graph. For each vertex of G we decide randomly and independently: with probability p we paint it blue and with probability 1-p we paint it yellow. Now, consider the subgraph of blue vertices: does it contain an infinite connected component? There is a critical probability p_c(G), such that if p>p_c then almost surely there is a blue infinite connected component and if p

p_c or p