Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 23, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Tuan Tran

Erdos-Rothschild problem for intersecting families

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login