 Monotone coupling of binomial random graphs

Assign an independent uniform label $U_e$ to every possible edge and include $e$ in $G(n,p)$ exactly when $U_e\le p$. This couples all edge probabilities so that $p\le q$ implies $G(n,p)\subseteq G(n,q)$.