Abstract
We present a unified framework to asymptotically count the number of sets, with a given cardinality, free of certain configurations. This is done by combining the hypergraph containers methodology joint with arithmetic removal lemmas.
Several applications involving linear configurations are described, as well as some applications in the random sparse setting.