A generalised transference principle

Abstract

The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by Conlon and Gowers [Ann. of Math. 2016], involves establishing a 'transference principle' which allows one to translate between robust properties in the dense setting and the sparse $p$-random setting, provided $p$ is not too small. Our results provide a more general transference theorem, extending the results of Conlon and Gowers and also those of Schacht [Ann. of Math. 2016]. Among a variety of other applications, we use this to obtain a sparse counting lemma for graphs and hypergraphs which are not necessarily strictly balanced. Our method achieves asymptotically optimal bounds on the probability $p$, and the probability of success.

69 pages