A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph

We consider non-overlapping subgraphs of fixed order in the random graph K_n, p(n). Fix a strictly strongly balanced graph G. A subgraph of K_{n, p(n)} isomorphic to G is called a G-subgraph. Let X_n be the number of G-subgraphs of K_{n, p(n)} vertex disjoint to all other G-subgraphs. We show that if EX_n]→∞ as n→, then X_n/EX_n] converges to 1 in probability. Also, if EX_n]→c as n→∞, then X_n satisfies a Poisson limit theorem. the Poisson limit theorem is shown using a correlation inequality similar to those appeared in Janson, ?uczak, and Ruciñski8] and Boppana and Spencer 4].