  We present an algorithm for bounding the probability of r-core formation in
k-uniform hypergraphs. Understanding the probability of core formation is
useful in numerous applications including bounds on the failure rate of
Invertible Bloom Lookup Tables (IBLTs) and the probability that a boolean
formula is satisfiable.
