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

Date and Time: Thursday, November 03, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Lior Gishboliner

Polynomial removal lemmas: overview and new results

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.

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

Previous talks by year:   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