Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information
Date and Time: Thursday, November 03, 2022, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Lior Gishboliner
The removal lemma is a cornerstone of extremal graph theory. It has many generalizations and extensions to other combinatorial structures, such as induced subgraphs, hypergraphs, digraphs and matrices. A general open question is to characterize the cases in which the removal lemma has polynomial bounds. I will survey the state of knowledge on this general problem and present some new results. Based on joint works with A. Shapira and I. Tomon.
Automatic MiSe System Software Version 1.4803M | admin login