BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20160412T171500
DTEND;VALUE=DATE:20160412T171500
UID:5739@agenda.unifr.ch
DESCRIPTION:Extremal combinatorics is one of the central branches of discrete mathematics that deals with the problem of estimating the maximum possible size of a combinatorial structure which satisfies certain restrictions. Often, such problems also have applications to other areas including theoretical computer science, additive number theory and information theory. In his talk, we will illustrate this fact using several closely related examples that focus on a recent work with Alon and Moitra.\n
SUMMARY:Prof. Dr. Benjamin Sudakov (ETH Zürich): Induced matchings, arithmetic progressions and communication
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5739
END:VEVENT
END:VCALENDAR