BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The size-Ramsey number of a hypergraph H is the minimum number
  of edges in a hypergraph G whose every 2-edge-colouring contains a monochr
 omatic copy of H. This talk will be about showing that the size-Ramsey numb
 er of r-uniform tight path on n vertices is linear in n. Similar results ab
 out hypergraph trees and their powers will also be discussed. This is joint
  work with Letzter and Yepremyan. 
DTSTAMP:20210614T200400
DTSTART:20210621T141500
CLASS:PUBLIC
LOCATION:online
SEQUENCE:0
SUMMARY:Alexey Pokrovskiy (University College London): Linear size Ramsey n
 umbers of hypergraphs
UID:107918320@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20210621-L-Pok
 rovskiy.html
END:VEVENT
END:VCALENDAR