BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yufei Zhao (MIT)
DTSTART:20200423T173000Z
DTEND:20200423T183000Z
DTSTAMP:20260422T225759Z
UID:Stanfordcombinatorics/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Stanfordcomb
 inatorics/1/">Regularity methods for sparse graphs and its applications</a
 >\nby Yufei Zhao (MIT) as part of Stanford Online Combinatorics Seminar\n\
 n\nAbstract\nThe extension of Szemerédi's regularity method to sparse set
 tings has led to important applications\, with the Green-Tao theorem being
  a notable example.\n\nWe develop new counting and removal lemmas for grap
 hs with few 4-cycles. I will present a number of applications to extremal 
 problems on graphs\, hypergraphs\, and sets avoiding solutions to certain 
 equations.\n\nJoint work with David Conlon\, Jacob Fox\, and Benny Sudakov
 .\n
LOCATION:https://researchseminars.org/talk/Stanfordcombinatorics/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nikhil Srivastava (UC Berkeley)
DTSTART:20200521T170000Z
DTEND:20200521T180000Z
DTSTAMP:20260422T225759Z
UID:Stanfordcombinatorics/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Stanfordcomb
 inatorics/2/">Girth\, expansion\, and localization of graph eigenfunctions
 </a>\nby Nikhil Srivastava (UC Berkeley) as part of Stanford Online Combin
 atorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/Stanfordcombinatorics/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Matija Bucic (ETH Zurich)
DTSTART:20200528T170000Z
DTEND:20200528T180000Z
DTSTAMP:20260422T225759Z
UID:Stanfordcombinatorics/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Stanfordcomb
 inatorics/3/">Large cliques and independent sets all over the place</a>\nb
 y Matija Bucic (ETH Zurich) as part of Stanford Online Combinatorics Semin
 ar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/Stanfordcombinatorics/3/
END:VEVENT
END:VCALENDAR