David Conlon - “Sparse counting lemmas“ | MoCCA’20

The talk “Sparse counting lemmas“ by David Conlon on the Moscow Conference on Combinatorics and Applications at MIPT. Annotation: The past decade has seen a flurry of activity on sparse analogues of the classical regularity method. The key difficulty in applying this method in a sparse context is to establish appropriate counting lemmas. In this talk, we will describe how such counting lemmas, though not true in general, can be salvaged in certain situations. In particular, we will discuss recent work with Fox, Sudakov and Zhao on counting lemmas relative to graphs with no 4-cycles and its many applications in extremal and additive combinatorics. The full schedule of the conference -