BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Aditya Potukuchi (University of Illinois at Chicago)
DTSTART:20210524T140000Z
DTEND:20210524T150000Z
DTSTAMP:20260423T035409Z
UID:EPC/71
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/71/">Enu
 merating independent sets in Abelian Cayley graphs</a>\nby Aditya Potukuch
 i (University of Illinois at Chicago) as part of Extremal and probabilisti
 c combinatorics webinar\n\n\nAbstract\nWe show that any Cayley graph on an
  Abelian group of order 2n and degree $\\tilde{\\Omega}(\\log n)$ has at m
 ost $2^{n+1}(1 + o(1))$ independent sets. This bound is tight up to the $o
 (1)$ term whenever the graph is bipartite. The proof is based on the conta
 iner method and the Pl\\"{u}nnecke-Rusza-Petridis inequality from additive
  combinatorics.\n\nJoint work with Liana Yepremyan.\n
LOCATION:https://researchseminars.org/talk/EPC/71/
END:VEVENT
END:VCALENDAR