BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:The approximate structure of triangle-free graphs
DTSTART:20250512T143000
DTEND:20250512T153000
DTSTAMP:20260531T141916Z
UID:710fcdf3b972050bae64a3eb7d9b7abda732bc22c702d33a3d1d64e6
CATEGORIES:Conferences - Seminars
DESCRIPTION:Yuval Wigderson\nA natural way of constructing a dense triangl
 e-free graph is to start with a triangle-free graph $G_0$ of bounded size\
 , blow it up\, and then delete some edges. Many of the natural triangle-fr
 ee graphs we encounter\, such as all bipartite graphs\, can be obtained in
  this way.\n\nAstonishingly\, deep results in extremal graph theory imply 
 that this is essentially the *only* way of constructing dense triangle-fre
 e graphs (up to a small error). Unfortunately\, such results are of limite
 d applicability\, due to the poor quantitative aspects of known proof tech
 niques. In this talk\, I will discuss this problem\, and describe several 
 settings in which we can prove much stronger bounds. No background in extr
 emal graph theory will be assumed.\n\nBased on joint work with Lior Gishbo
 liner and Eoin Hurley.
LOCATION:CM 1 517
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR