BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Xizhi Liu (Warwick)
DTSTART:20220427T130000Z
DTEND:20220427T140000Z
DTSTAMP:20260423T003237Z
UID:WCS/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/52/">The
  feasible region of induced graphs</a>\nby Xizhi Liu (Warwick) as part of 
 Warwick Combinatorics Seminar\n\n\nAbstract\nFix a graph $F$. A classical 
 problem in extremal graph theory asks about how many induced copies of $F$
  can a graph with edge density $\\rho$ have? The only case in which we kno
 w the asymptotic solution is when $F$ is a complete graph\, and it was sol
 ved completely only recently by Reiher using the flag algebra machinery. W
 e will consider the other cases and show some results when $F$ is a comple
 te bipartite graph or a complete graph minus one edge. Many interesting re
 lated open problems will also be introduced. Joint work with Dhruv Mubayi 
 and Christian Reiher.\n
LOCATION:https://researchseminars.org/talk/WCS/52/
END:VEVENT
END:VCALENDAR