BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Corrine Yap (Rutgers University)
DTSTART:20210118T140000Z
DTEND:20210118T150000Z
DTSTAMP:20260423T035541Z
UID:EPC/43
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/43/">A T
 opological Turán Problem</a>\nby Corrine Yap (Rutgers University) as part
  of Extremal and probabilistic combinatorics webinar\n\n\nAbstract\nThe cl
 assical Turán problem asks: given a graph H\, how many edges can an n-ver
 tex graph have while containing no isomorphic copy of H? By viewing (k+1)-
 uniform hypergraphs as k-dimensional simplicial complexes\, we can ask a t
 opological version of this (first posed by Nati Linial): given a k-dimensi
 onal simplicial complex S\, how many facets can an n-vertex k-dimensional 
 simplicial complex have while containing no homeomorphic copy of S? Until 
 recently\, little was known for k > 2. In this talk\, we give an answer fo
 r general k\, by way of dependent random choice and the combinatorial noti
 on of a trace-bounded hypergraph. Joint work with Jason Long and Bhargav N
 arayanan.\n
LOCATION:https://researchseminars.org/talk/EPC/43/
END:VEVENT
END:VCALENDAR