BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Miloš Trujić (ETH Zürich)
DTSTART:20220210T151500Z
DTEND:20220210T170000Z
DTSTAMP:20260422T065546Z
UID:CJCS/48
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/48/">Tw
 o problems in (size-)Ramsey theory</a>\nby Miloš Trujić (ETH Zürich) as
  part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAbstract\nIn 1978
 \, Erdős\, Faudree\, Rousseau\, and Schelp introduced the study of the si
 ze-Ramsey\nnumber of a graph H\, defined as a minimum positive integer m f
 or which there exists a\ngraph G with m edges such that in every colouring
  of its edges by two colours there is a\nmonochromatic copy of H. I will d
 iscuss recent advances for two problems in this area when\nH is a large gr
 aph of bounded maximum degree. This is joint work with David Conlon and \n
 Rajko Nenadov.\n
LOCATION:https://researchseminars.org/talk/CJCS/48/
END:VEVENT
END:VCALENDAR