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, March 23, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Zhihan Jin

The Minimum Degree Removal Lemma Thresholds

The graph removal lemma is a fundamental result in extremal graph theory, which says that for every fixed graph H and &#x3B5>0, if an n-vertex graph G contains &#x3B5n^2 edge-disjoint copies of H then G contains &#x3B4n^{v(H)} copies of H for some &#x3B4=&#x3B4(&#x3B5,H)>0. The current proofs of the removal lemma give only very weak bounds on &#x3B4(&#x3B5,H), and it is also known that &#x3B4(&#x3B5,H) is not polynomial in &#x3B5 unless H is bipartite. Recently, Fox and Wigderson initiated the study of minimum degree conditions guaranteeing that &#x3B4(&#x3B5,H) depends polynomially or linearly on &#x3B5. In this paper we answer several questions of Fox and Wigderson on this topic. In particular, we provide the polynomial removal lemma threshold for odd cycles and give the full characterization of the linear removal lemma threshold for 3-chromatic graphs.

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