Five and a half proofs of one theorem

Abstract: The Erdos-Ko-Rado theorem is the cornerstone of the modern field of extremal combinatorics. In this talk we consider one of the variants of this theorem, in the setting of the product measure on the discrete cube, and present (time permitting) several different proofs of it, using a surprisingly eclectic set of tools.

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).