BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Benny Sudakov (Zurich)
DTSTART:20201120T140000Z
DTEND:20201120T150000Z
DTSTAMP:20260423T003231Z
UID:WCS/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/11/">Lar
 ge independent sets from local considerations</a>\nby Benny Sudakov (Zuric
 h) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nHow well can gl
 obal properties of a graph be inferred from observations that are purely l
 ocal? This general question gives rise to numerous interesting problems. O
 ne such very natural question was raised independently by Erdos-Hajnal and
  Linial-Rabinovich in the early 90's. How large must the independence numb
 er $\\alpha (G)$ of a graph $G$ be whose every $m$ vertices contain an ind
 ependent set of size $r$? In this talk we discuss new methods to attack th
 is problem which improve many previous results.\n
LOCATION:https://researchseminars.org/talk/WCS/11/
END:VEVENT
END:VCALENDAR