Cliques and sunflowers under bounded VC-dimension

Abstract: The VC-dimension of a set system is one of the most useful combinatorial parameters that measures its complexity, and, apart from its geometric applications, it has proved to be relevant in many other areas such as statistics, logic, and learning theory. In this talk, I will discuss two well-known combinatorial problems under bounded VC-dimension: estimating multicolor Ramsey numbers and the sunflower problem. This talk is based on joint works with Jacob Fox and Janos Pach.

combinatoricsprobability

Audience: researchers in the topic

Extremal and probabilistic combinatorics webinar

Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).