BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Fan Wei (Princeton University)
DTSTART:20201022T020000Z
DTEND:20201022T030000Z
DTSTAMP:20260423T021016Z
UID:SCMSComb/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/16/
 ">Some variants of the graph removal lemma</a>\nby Fan Wei (Princeton Univ
 ersity) as part of SCMS Combinatorics Seminar\n\n\nAbstract\nAmong the num
 erous applications of the regularity lemma\, a classical one is the graph 
 removal lemma. It has applications in fields such as number theory and the
 oretical computer science. For every fixed graph H\, the H-removal lemma g
 ives a highly nontrivial equivalence between the density of H in G and the
  L1 distance between a graph G to the set of H-free graphs. Whether the hu
 ge bound in the quantitative estimate is necessary remains a big open ques
 tion in graph theory. In this talk\, I will discuss some recent works on a
  strengthening of the usual graph removal lemma.  This talk is based on 
 some joint work with Jacob Fox.\n\npassword 121323\n
LOCATION:https://researchseminars.org/talk/SCMSComb/16/
END:VEVENT
END:VCALENDAR