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:20260423T035609Z
UID:WAC/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WAC/3/">Sums
  and products along edges of sparse graphs</a>\nby Jozsef Solymosi (UBC) a
 s part of Webinar in Additive Combinatorics\n\n\nAbstract\nIn their semina
 l paper Erdős and Szemerédi formulated conjectures on the size of sum se
 t and product set of integers. The strongest form of their conjecture is a
 bout sums and products along the edges of a graph\, when we consider sums 
 and products of some pairs only. With Noga Alon and Imre Ruzsa we showed t
 hat this strong form of the Erdős-Szemerédi conjecture does not hold. In
  this talk I will list some related problems and recent results.\n
LOCATION:https://researchseminars.org/talk/WAC/3/
END:VEVENT
END:VCALENDAR