Combinatorics Seminar

When: Sunday, November 13, 10am Where: Schreiber 309 Speaker: Lior Gishboliner, Tel Aviv University Title: Removal Lemmas with Polynomial Bounds

Abstract:

Addressing a problem of Alon and Fox, we prove new sufficient and necessary criteria, guaranteeing that a graph property admits a removal lemma with a polynomial bound. Although both are simple combinatorial criteria, they imply almost all prior positive and negative results of this type, as well as many new ones.

Joint work with Asaf Shapira.