BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Forbidden hypergraphs
DTSTART:20240118T140000
DTEND:20240118T150000
DTSTAMP:20260410T034208Z
UID:5a2dca82e322396bf01a7f356661af0feb4b80b51af681e4d021069e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr Shoham LETZTER – University College London\nSeminar in Ma
 thematics - zoom only\n\nA typical problem in extremal graph theory asks t
 o determine how many edges a (hyper)graph can have if it has a given numbe
 r of vertices and no copies of a given (hyper)graph H. While this problem 
 is well understood for most graphs\, much less is known for hypergraphs. I
 n this talk I will give an overview of the status of this problem for grap
 hs\, and present a new result in this direction about hypergraphs.\n\nThis
  talk is based on joint work with Nina Kamčev and Alexey Pokrovskiy\, and
  is designed to be accessible to a general maths audience.\n\n 
LOCATION:https://epfl.zoom.us/j/67006120410
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR