Article ID Journal Published Year Pages File Type
4651944 Electronic Notes in Discrete Mathematics 2015 9 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics