Tel-Aviv University
School of Mathematical Sciences

Department Colloquium

Monday, January 13, 2014

Schreiber 006, 12:15

Benny Sudakov


Induced Matchings, Arithmetic Progressions and Communication

Extremal Combinatorics is one of the central branches of discrete
mathematics which deals with the problem of estimating the maximum
possible size of a combinatorial structure which satisfies certain
restrictions. Often, such problems have also applications to other
areas including Theoretical Computer Science, Additive Number Theory
and Information Theory. In this talk we will illustrate this fact by
several closely related examples focusing on a recent work with Alon
and Moitra.

Coffee will be served at 12:00 before the lecture
at Schreiber building 006