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:20260404T095455Z
UID:Stanfordcombinatorics/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Stanf
 ordcombinatorics/1/">Regularity methods for sparse graphs and its applicat
 ions</a>\nby Yufei Zhao (MIT) as part of Stanford Online Combinatorics Sem
 inar\n\n\nAbstract\nThe extension of Szemerédi's regularity method to spa
 rse settings has led to important applications\, with the Green-Tao theore
 m being a notable example.\n\nWe develop new counting and removal lemmas f
 or graphs with few 4-cycles. I will present a number of applications to ex
 tremal problems on graphs\, hypergraphs\, and sets avoiding solutions to c
 ertain equations.\n\nJoint work with David Conlon\, Jacob Fox\, and Benny 
 Sudakov.\n
LOCATION:https://stable.researchseminars.org/talk/Stanfordcombinatorics/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nikhil Srivastava (UC Berkeley)
DTSTART:20200521T170000Z
DTEND:20200521T180000Z
DTSTAMP:20260404T095455Z
UID:Stanfordcombinatorics/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Stanf
 ordcombinatorics/2/">Girth\, expansion\, and localization of graph eigenfu
 nctions</a>\nby Nikhil Srivastava (UC Berkeley) as part of Stanford Online
  Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/Stanfordcombinatorics/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Matija Bucic (ETH Zurich)
DTSTART:20200528T170000Z
DTEND:20200528T180000Z
DTSTAMP:20260404T095455Z
UID:Stanfordcombinatorics/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/Stanf
 ordcombinatorics/3/">Large cliques and independent sets all over the place
 </a>\nby Matija Bucic (ETH Zurich) as part of Stanford Online Combinatoric
 s Seminar\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/Stanfordcombinatorics/3/
END:VEVENT
END:VCALENDAR