Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, November 23, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Tuan Tran
The Erdos-Rothschild problem is a twist on the typical extremal problem, asking for the structure with the maximum number of r-colourings without a monochromatic forbidden substructure. Recently, there has been a great deal of interest in the Erdos-Rothschild problem for intersecting families. We will present a general framework that allows us to extend these previous results to much larger, and, in some cases, optimal, choices of parameters of the families in question. This proof also applies to new settings, such as intersecting families of permutations. Joint work with Dennis Clemens and Shagnik Das.
Automatic MiSe System Software Version 1.4803M | admin login