1. P. Allen, J. Böttcher, H. Hàn, Y. Kohayakawa, Y. Person, Blow-up lemmas for sparse graphs, ArXiv e-prints (Dec. 2016), available at arXiv:1612.00622.
2. The number of edge colorings with no monochromatic cliques;Alon;J. Lond. Math. Soc.,2004
3. Counting sum-free sets in abelian groups;Alon;Israel J. Math.,2014
4. R.G. Alves, A. Procacci, R. Sanchis, A local lemma via entropy compression, ArXiv e-prints (Sep. 2015), available at arXiv:1509.04638.
5. The number of subsets of integers with no k-term arithmetic progression;Balogh;Int. Math. Res. Not.,2016