The lefthanded local lemma characterizes chordal dependency graphs

Authors

  • Wesley Pegden

    Corresponding author
    1. Courant Institute of Mathematical Sciences, New York University, New York, New York 10012
    • Courant Institute of Mathematical Sciences, New York University, New York, New York 10012
    Search for more papers by this author

Abstract

Shearer gave a general theorem characterizing the family equation image of dependency graphs labeled with probabilities pv which have the property that for any family of events with a dependency graph from equation image (whose vertex-labels are upper bounds on the probabilities of the events), there is a positive probability that none of the events from the family occur.

We show that, unlike the standard Lovász Local Lemma—which is less powerful than Shearer's condition on every nonempty graph—a recently proved ‘Lefthanded’ version of the Local Lemma is equivalent to Shearer's condition for all chordal graphs. This also leads to a simple and efficient algorithm to check whether a given labeled chordal graph is in equation image. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012

Ancillary