BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An exponential upper bound on induced Ramsey numbers - Marcelo Cam
 pos (IMPA)
DTSTART:20251022T123000Z
DTEND:20251022T133000Z
UID:TALK237820@talks.cam.ac.uk
CONTACT:Julia Wolf
DESCRIPTION:The induced Ramsey number R_ind(H) of a graph H is the minimum
  number N such that there exists a graph with N vertices for which all red
 /blue colorings of its edges contain a monochromatic induced copy of H. In
  this talk I'll show there exists an absolute constant C > 0 such that\, f
 or every graph H on k vertices\, these numbers satisfy R_ind(H) ≤ 2^Ck^.
  This resolves a conjecture of Erdős from 1975. \n\nThis is joint work wi
 th Lucas Aragão\, Gabriel Dahia\, Rafael Filipe\, João Marciano.
LOCATION:MR4\, CMS
END:VEVENT
END:VCALENDAR