BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jozsef Solymosi (UBC)
DTSTART:20200601T160000Z
DTEND:20200601T170000Z
DTSTAMP:20260404T143402Z
UID:WAC/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/WAC/3
 /">Sums and products along edges of sparse graphs</a>\nby Jozsef Solymosi 
 (UBC) as part of Webinar in Additive Combinatorics\n\n\nAbstract\nIn their
  seminal paper Erdős and Szemerédi formulated conjectures on the size of
  sum set and product set of integers. The strongest form of their conjectu
 re is about sums and products along the edges of a graph\, when we conside
 r sums and products of some pairs only. With Noga Alon and Imre Ruzsa we s
 howed that this strong form of the Erdős-Szemerédi conjecture does not h
 old. In this talk I will list some related problems and recent results.\n
LOCATION:https://stable.researchseminars.org/talk/WAC/3/
END:VEVENT
END:VCALENDAR