Lopsided Lovász local lemma

Let $A_1,\dots ,A_m$ be bad events with a lopsidependency graph. If numbers $x_i\in [0,1)$ satisfyfor every $i$, then $\mathbb{P}({\bigcap }_i{A}_i^c)>0$. Unlike the ordinary Lovász local lemma, a lopsidependency graph may omit pairs whose interaction can only make their simultaneous avoidance easier.

For bad events $A_i$, a correlation graph is sufficient for the Lopsided Lovász local lemma when, for every set $S$ of nonneighbors and every positive-probability conditioning event, $\mathbb{P}(A_i\mid {\bigcap }_{j\in S}{A}_j^c)\le \mathbb{P}(A_i)$. A dependency graph of events satisfies this with equality. The condition concerns simultaneous avoidance, not just signs of pairwise correlations.